login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A219189
Parity of pi(5^n).
0
0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1
OFFSET
0
COMMENTS
The parity of pi(n) is obtained without calculating pi(n), and much more quickly. See the paper below.
EXAMPLE
a(4) = pi(5^4) mod 2 = 114 mod 2 = 0.
MATHEMATICA
Table[Mod[PrimePi[5^n], 2], {n, 10}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Henri Lifchitz, Nov 14 2012
STATUS
approved