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.

A073264 Prime digits in the decimal expansion of Pi (with repetitions, in order of appearance).

Original entry on oeis.org

3, 5, 2, 5, 3, 5, 7, 3, 2, 3, 2, 3, 3, 3, 2, 7, 5, 2, 7, 3, 3, 7, 5, 5, 2, 7, 5, 2, 3, 7, 2, 2, 2, 3, 2, 5, 3, 2, 7, 7, 2, 5, 3, 2, 2, 3, 7, 3, 5, 5, 5, 2, 2, 3, 7, 2, 5, 3, 5, 2, 7, 5, 2, 2, 7, 3, 5, 2, 5, 5, 5, 2, 2, 5, 3, 3, 2, 7, 5, 5, 3, 3, 2, 7, 5, 2, 3, 3, 7, 7, 3, 5, 2, 7, 2, 5, 5, 2, 3, 3, 5, 3, 2, 2, 3
Offset: 1

Views

Author

Y. Kelly Itakura (yitkr(AT)mta.ca), Aug 22 2002

Keywords

Comments

The prime digits in the decimal expansion of Pi, i.e., the range of this sequence, are the exactly all single digit primes, A000040(1..4) = {2, 3, 5, 7}. - M. F. Hasler, Jul 27 2024

Examples

			Pi = 3.141592653... so we get 3,5,2,5,3...
		

Crossrefs

Programs

  • Mathematica
    Select[RealDigits[Pi,10,600][[1]],PrimeQ] (* Harvey P. Dale, Jul 19 2017 *)
  • PARI
    primespi(n) = default(realprecision,100000); p = Pi/10; s = 0; default(realprecision,28); for(x=1,n, d = p*10; d1=floor(d); if(isprime(d1) ,print1(d1, ", "); s++; ); p = frac(d)); \\ Cino Hilliard, Sep 06 2003
    
  • PARI
    A073264_upto(N=100)=localprec(N*3); select(isprime, digits(Pi\1000^-N))[1..N] \\ M. F. Hasler, Jul 27 2024

Extensions

More terms from Cino Hilliard, Sep 06 2003
Offset corrected by M. F. Hasler, Jul 27 2024