A121267 -id:A121267 - cp's OEIS frontend

A047777 Primes seen in the decimal expansion of Pi (disregarding the decimal point) that are contiguous, smallest and distinct.

3, 14159, 2, 653, 5, 89, 7, 9323

Offset: 1

Sequence A121267 gives the number of digits of a(n) [but see also A229181 for a variant, cf. below]. The terms a(9)-a(11) had been found by Chris Nash in October 1999, and primality of the 3057-digit term a(9) has been proved in September 2002 by J. K. Andersen, who also found the next 5 terms a(12)-a(16) and the bound a(17) > 10^32000, cf. Rivera's web page "Problem 18". - M. F. Hasler, Aug 31 2013

There is a natural variant of the present sequence, using the same definition except for not requiring that all primes have to be distinct. That variant would have the same 3057-digit prime as next term a(9), and therefore have the same displayed terms and not justify a separate entry in the OEIS. However, terms beyond a(9) would be different: instead of a(10) = 73, a(11) = 467 and the 14650-digit PRP a(11), it would be followed by a'(10) = 7, a'(11) = 3 (which cuts a(10) = 73 in two pieces), a'(12) = 467, a'(13) = a'(14) = 2, and a'(15) equal to a 748-digit prime, see the a-file from J.-F. Alcover. Sequence A229181 lists the size of these terms. - M. F. Hasler, Sep 15 2013, updated Jan 18 2019

			The first digit of Pi = 3.14159... is the prime 3, therefore a(1) = 3.
We discard this digit 3, and look for the first time a chunk of subsequent digits (always starting with the 1 coming right after the previously used 3) would be prime: 1, 14, 141, 1415 are not, but 14159 is. (The single-digit prime '5' was not considered, because we require the primes made from the whole contiguous chunk of digits starting after the previously found prime.) Thus, a(2) = 14159.
Thereafter, we have the single-digit prime a(3) = 2, and then a(4) = 653 (since neither 6 nor 65 is prime). - _M. F. Hasler_, Jan 18 2019

Jean-Francois Alcover, Table of n, v(n) for n = 1..100 for the variant with duplicates described in the comment. Initially submitted on Oct 16 2013 as b-file, uploaded as a-file by _Georg Fischer_, Jan 18 2019
Joseph L. Pe, Trying to Write e as a Concatenation of Primes (2009) [from Internet Archive Wayback Machine]
Carlos Rivera, Problem 18. Pi as a concatenation of the smallest contiguous different primes, The Prime Puzzles and Problems Connection.
Index entries related to "constant primes".

Cf. A053013, A000796.

Cf. A005042, A104841, A198018, A198019, A198187.

digits = Join[{{3}}, RealDigits[Pi, 10, 4000] // First // Rest]; used = {}; primes = digits //. {a:({Integer..}..), b__Integer /; PrimeQ[p = FromDigits[{b}]] && FreeQ[used, p], c___Integer} :> (Print[p]; AppendTo[used, p]; {a, {p}, c}); Select[primes, Head[#] == List &] // Flatten (* _Jean-François Alcover, Oct 16 2013 *)

{default(realprecision,N=3500); x=Pi; S=a=[]; while(N > L=logint(p=floor(x),10), L%200||!L||print1("/*"L"*/"); if( ispseudoprime(p) && !setsearch(S,p), S=Set(a=concat(a,p)); print1(p","); x-=p; N-=logint(p,10)); x*=10); default(realprecision,38); a} \\ Remove the condition "&& !setsearch(S,p)" to get the variant allowing repetitions. The instruction "L%200..." is a progress indicator; it can be safely removed. - M. F. Hasler, Jan 18 2019

The next term is the 3057-digit prime formed from digits 19 through 3075. It is 846264338327950...708303906979207. - Mark R. Diamond, Feb 22 2000

The two terms after that are 73 and 467. - Jason Earls, Apr 05 2001

A229181 Number of decimal digits in the variant of A047777(n) (decimal expansion of Pi cut in "prime chunks") without the restriction that all primes must be different.

Original entry on oeis.org

1, 5, 1, 3, 1, 2, 1, 4, 3057, 1, 1, 3, 1, 1, 748, 2, 2, 1, 2, 83, 5, 1, 2, 71, 10, 1, 1, 2, 2, 2, 1, 1, 3, 1, 14, 2, 5, 51, 1, 6, 1, 6, 3, 2, 9, 1, 16, 2, 3, 43, 1, 6, 19, 1, 5, 3, 1999, 1, 1, 2, 22, 1, 3, 1, 2, 2, 1, 2, 2, 5, 1, 1, 1, 1, 4, 1, 1, 3, 7, 5, 1, 6, 4, 3, 1, 10, 7, 1, 2, 11, 2, 5, 1, 13, 1, 20, 16, 1, 9, 16

Offset: 1

M. F. Hasler, Sep 15 2013

A variant of A121267. First differences of A053013. See these two sequences for further details.

C. Rivera, Prime strings

Cf. A047777, A053013, A121267, A229155.

A229181 = {1}; digits = Join[{{1}}, RealDigits[Pi, 10, 10^4] // First // Rest]; digits //. {a:({A229181,%20lg%5D;%20%7B%7B1%7D,%20c%7D)%20;%20A229181%20(*%20_Jean-Fran%C3%A7ois%20Alcover">Integer..}..), b__Integer /; PrimeQ[FromDigits[{b}]], c___Integer} :> (Print[lg = {b} // Length]; AppendTo[A229181, lg]; {{1}, c}) ; A229181 (* _Jean-François Alcover, Oct 17 2013 *)

default(realprecision,5000);c=Pi/10;u=[];for(k=1,9e9,ispseudoprime(c\.1^k) & !print1(k,",") & k=0*c=frac(c*10^k))

More terms from Jean-François Alcover, Oct 17 2013

A229155 Number of digits of the n-th term of the decimal expansion of e = exp(1) cut into chunks of primes.

Original entry on oeis.org

1, 1, 649, 1, 1, 2, 29, 1, 1, 2, 1, 1, 1, 53, 1872, 3, 5

Offset: 1

M. F. Hasler, Sep 15 2013

Trying to cut the decimal expansion A001113 of e=2.718281828... into "prime chunks", one gets (2, 7, p, 5, 3, 11, q, 7, 3, 61, 3, 3, 2, r, ...) where p, q, r are 649-, 29-, 53-digit primes, respectively. The size of p makes it impossible to register this more fundamental sequence in the OEIS as it is done in A047777 for Pi. This led us to store just the length of the terms in this sequence.

Sequence A121267 is a (not exact) analog for Pi; note that A047777 requires all primes to be distinct, while we allow repetition of 7, 3, 2, ... as seen in the above example. If we did not, the terms following 29 would be 2, 2, 6, 3, 7, 8, 3, 441, 9, 17, ... instead of 1, 1, 2, 1, 1, 1, 53, ...

Joseph L. Pe, Trying to Write e as a Concatenation of Primes (2009)

Cf. A007512, A001113, A047658, A064118.

default(realprecision,2000);c=exp(1)/10;for(k=1,9e9,ispseudoprime(c\.1^k) & !print1(k,",") & k=0*c=frac(c*10^k))

a(15)-a(17) from Jinyuan Wang, Mar 26 2020

cp's OEIS Frontend

A047777 Primes seen in the decimal expansion of Pi (disregarding the decimal point) that are contiguous, smallest and distinct.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A229181 Number of decimal digits in the variant of A047777(n) (decimal expansion of Pi cut in "prime chunks") without the restriction that all primes must be different.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A229155 Number of digits of the n-th term of the decimal expansion of e = exp(1) cut into chunks of primes.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Extensions