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!)
A229155 Number of digits of the n-th term of the decimal expansion of e = exp(1) cut into chunks of primes. 2
1, 1, 649, 1, 1, 2, 29, 1, 1, 2, 1, 1, 1, 53, 1872, 3, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
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, ...
LINKS
PROG
(PARI) default(realprecision, 2000); c=exp(1)/10; for(k=1, 9e9, ispseudoprime(c\.1^k) & !print1(k, ", ") & k=0*c=frac(c*10^k))
CROSSREFS
Sequence in context: A035755 A107551 A202056 * A154358 A252538 A185666
KEYWORD
nonn,base,more
AUTHOR
M. F. Hasler, Sep 15 2013
EXTENSIONS
a(15)-a(17) from Jinyuan Wang, Mar 26 2020
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 July 17 04:55 EDT 2024. Contains 374360 sequences. (Running on oeis4.)