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).

This page as a plain text file.
%I A073264 #14 Jul 27 2024 23:55:29
%S A073264 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,
%T A073264 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,
%U A073264 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
%N A073264 Prime digits in the decimal expansion of Pi (with repetitions, in order of appearance).
%C A073264 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
%e A073264 Pi = 3.141592653... so we get 3,5,2,5,3...
%t A073264 Select[RealDigits[Pi,10,600][[1]],PrimeQ] (* _Harvey P. Dale_, Jul 19 2017 *)
%o A073264 (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
%o A073264 (PARI) A073264_upto(N=100)=localprec(N*3); select(isprime, digits(Pi\1000^-N))[1..N] \\ _M. F. Hasler_, Jul 27 2024
%Y A073264 Cf. A000796, A073303.
%K A073264 easy,nonn,base
%O A073264 1,1
%A A073264 Y. Kelly Itakura (yitkr(AT)mta.ca), Aug 22 2002
%E A073264 More terms from _Cino Hilliard_, Sep 06 2003
%E A073264 Offset corrected by _M. F. Hasler_, Jul 27 2024