STATUS
editing
approved
editing
approved
Number of primes = = 2 mod 3 dividing n.
approved
editing
a(n) = (1/2)*Sum_{p|n} (p*(p - 1) mod 3), where p is a prime. - Ridouane Oudra, Mar 21 2021
proposed
approved
editing
proposed
a(n) = (1/2)*Sum_{p|n} (p*(p - 1) mod 3), where p is a prime. - Ridouane Oudra, Mar 21 2021
approved
editing
proposed
approved
editing
proposed
def a(n): return sum([1 for p in primefactors(n) if p%3==2])
print map([a, (n) for n in range(1, 101)]) # Indranil Ghosh, Jul 11 2017
approved
editing
print map(a, xrangerange(1, 101)) # Indranil Ghosh, Jul 11 2017
proposed
approved