login
This site is supported by donations to The OEIS Foundation.

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A219071 Parity of pi(10^n). 3
0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

0

COMMENTS

The parity of pi(n) is obtained without calculating pi(n), and much more quickly. See the paper below.

LINKS

Table of n, a(n) for n=0..28.

Henri Lifchitz, Parity of pi(n)

EXAMPLE

For n = 3, pi(10^3) = 168 = 0 (mod 2).

MATHEMATICA

Table[Mod[PrimePi[10^n], 2], {n, 0, 10}] (* T. D. Noe, Nov 13 2012 *)

CROSSREFS

Cf. A006880, A219097, A219098.

Sequence in context: A254379 A285139 A188037 * A257531 A214090 A242018

Adjacent sequences:  A219068 A219069 A219070 * A219072 A219073 A219074

KEYWORD

nonn

AUTHOR

Henri Lifchitz, Nov 11 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified May 29 16:53 EDT 2017. Contains 287252 sequences.