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!)
A198188 Primes from the decimal expansion of e, sorted first by the final digit index and then by length. 2

%I #13 Jan 27 2021 10:11:49

%S 2,7,71,271,2,281,2718281,2,5,59,5,2,3,23,523,4523,904523,5,3,53,353,

%T 8284590452353,2,7,360287,28459045235360287,7,47,8747,6028747,

%U 8182845904523536028747,71,360287471,8281828459045235360287471,3,13,74713,82818284590452353602874713

%N Primes from the decimal expansion of e, sorted first by the final digit index and then by length.

%H M. F. Hasler, <a href="/A198188/b198188.txt">Table of n, a(n) for n = 1..655</a>

%e The first digit, 2, is prime, so a(1) = 2.

%e The second digit, 7, is prime, so a(2) = 7. 27 is not prime.

%e The third digit, 1, is not prime, but 71 and 271 are, so a(3) = 71 and a(4) = 271.

%e a(17) shows that "leading zeros are not allowed", i.e., if a prime p is prefixed by a 0 then it is not listed twice. - _M. F. Hasler_, Feb 05 2012

%o (PARI) v=[2, 7, 1, 8, 2, 8, 1, 8, 2, 8, 4, 5, 9, 0, 4, 5, 2, 3, 5, 3, 6, 0, 2, 8, 7, 4, 7, 1, 3]

%o for(n=1, #v, x=0; p=1; forstep(k=n, 1, -1, x+=p*v[k]; p*=10; if(v[k]&&isprime(x), print1(x", "))))

%o (PARI) default(realprecision,D=300);for(i=0,D-5,E=exp(1)\.1^i;for(j=1,i+1,ispseudoprime(t=E%10^j) & t!=L print1(L=t","))) \\ _M. F. Hasler_, Feb 05 2012

%Y Cf. A095935.

%K nonn,base

%O 1,1

%A _Franklin T. Adams-Watters_, Oct 21 2011

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 April 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)