cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A094875 a(n)=1 if floor(Pi*10^n) is prime, otherwise a(n)=0.

Original entry on oeis.org

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
Offset: 0

Views

Author

Frederic E.D. Michaud (famillesmichaud(AT)hotmail.com), Jun 16 2004

Keywords

Examples

			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
		

Crossrefs

Programs

  • PARI
    \p 120 a=vector(100);v=1;for(i=1,100,a[i]=isprime(floor(Pi*v));v=v*10)

Extensions

More terms from Johan Claes, Jun 16 2004