login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094875 a(n)=1 if floor(Pi*10^n) is prime, otherwise a(n)=0. 0
1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
EXAMPLE
a(0)=1 because 3 is prime,
a(2)=0 because 314 is divided by 2
a(5)=1 because 314159 is prime
a(13)=0 because 31415926535897 is divided by 163
PROG
(PARI) \p 120 a=vector(100); v=1; for(i=1, 100, a[i]=isprime(floor(Pi*v)); v=v*10)
CROSSREFS
Sequence in context: A179771 A194677 A194667 * A359456 A012245 A256436
KEYWORD
nonn
AUTHOR
Frederic E.D. Michaud (famillesmichaud(AT)hotmail.com), Jun 16 2004
EXTENSIONS
More terms from Johan Claes, Jun 16 2004
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)