|
%I #21 Feb 11 2021 19:21:51
%S 2,11,223,3331,44449,555557,66666629,777777701,888888883,99999999907,
%T 1010101010101010101039,11111111111111111111111,
%U 12121212121212121212121223,1313131313131313131313131301,141414141414141414141414141497,15151515151515151515151515151501
%N Smallest prime beginning with at least n n's (in decimal notation).
%H M. F. Hasler, <a href="/A088639/b088639.txt">Table of n, a(n) for n=0..100</a>
%p a:= proc(n) local d, h, s;
%p s:= parse(cat(0, n$n));
%p for d from 0 do
%p for h to 10^d-1 do
%p if isprime(s+h) then return s+h fi
%p od:
%p s:= s*10;
%p od
%p end:
%p seq(a(n), n=0..16); # _Alois P. Heinz_, Feb 11 2021
%o (PARI) A088639(n)={ local(p=10^#Str(n),d=1); n*=(p^n-1)/(p-1); until( (d*=10)*(n+1)>p=nextprime(n*d), );p} /* _M. F. Hasler_, Jan 13 2009 */
%o (Python)
%o from sympy import isprime
%o def a(n):
%o if n == 0: return 2
%o nns, i, pow10 = int(str(n)*n), 1, 1
%o while True:
%o i = 1
%o while i < pow10:
%o t = nns * pow10 + i
%o if isprime(t): return t
%o i += 2
%o pow10 *= 10
%o print([a(n) for n in range(16)]) # _Michael S. Branicky_, Feb 11 2021
%Y Cf. A088640. See A068120 for another version. See also A065584 - A065592.
%K base,easy,nonn
%O 0,1
%A _Amarnath Murthy_, Oct 27 2003
%E More terms from _Ray Chandler_, Nov 01 2003
%E More cross-references and initial term added by _M. F. Hasler_, Jan 13 2009
| 