A185689 Final prime adjoined in the smallest term of A019518 divisible by 53^n.
1153, 5519, 1288769, 608227163, 3059326339
Offset: 1
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.
The number 2357...199211 is the first term in A019518 divisible by 43^1, therefore a(1) = 211.
a(n,m=43)={ my(s=10,p=2); n=Mod(0,m^n); while(n=n*s+p,(p=nextprime(p+1))>s & s*=10) ;p} \\ M. F. Hasler, Feb 08 2011
a(5) = 235699, because this is the largest prime less than 235711 (concatenation of first 5 primes, written in decimal system).
Table[NextPrime[FromDigits[Flatten[IntegerDigits[Prime[Range[n]]]]], -1], {n, 2, 17}]
0.235711131719232931374143475359616771737983899710110310710911312...
a033308 n = a033308_list !! (n-1) a033308_list = concatMap (map (read . return) . show) a000040_list :: [Int] -- Reinhard Zumkeller, Mar 03 2014
N[Sum[Prime[n]*10^-(n + Sum[Floor[Log[10, Prime[k]]], {k, 1, n}]), {n, 1, 40}], 100] (* Joseph Biberstine (jrbibers(AT)indiana.edu), Aug 12 2006 *) N[Sum[Prime@n*10^-(n + Sum[Floor[Log[10, Prime@k]], {k, n}]), {n, 45}], 106] (* Joseph Biberstine (jrbibers(AT)indiana.edu), Aug 12 2006 *) IntegerDigits //@ Prime@Range@45 // Flatten (* Robert G. Wilson v Oct 03 2006 *)
default(realprecision, 2080); x=0.0; m=-1; forprime (p=2, 4000, n=1+floor(log(p)/log(10)); x=p+x*10^n; m+=n; ); x=x/10^m; for (n=0, 2000, d=floor(x); x=(x-d)*10; write("b033308.txt", n, " ", d)); \\ Harry J. Smith, Apr 30 2009
concat( apply( {row(n)=digits(prime(n))}, [1..99] )) \\ Yields this sequence; row(n) then yields the digits of prime(n) = n-th row of the table, cf. comments. - M. F. Hasler, Oct 25 2019
Comments