OFFSET
1,1
COMMENTS
Observation: In most cases only one extra digit is required.
The observation is increasingly inaccurate for large n, where it happens with 'probability' ~ 10/n log n. But a(n) always exists due to the prime number theorem. - Charles R Greathouse IV, Nov 19 2010
LINKS
Jayanta Basu, Table of n, a(n) for n = 1..50
EXAMPLE
a(5) = 31253 because this is the smallest prime starting with 5^5 = 3125.
MAPLE
for i from 1 to 40 do a := nextprime(i^i*10); b := 1; while(a-i^i*10^b>=10^b) do b := b+1; a := nextprime(i^i*10^b); end do; c[i] := a; end do:q := seq(c[i], i=1..40);
MATHEMATICA
Table[p = i^i; k = 1; While[IntegerDigits[p] != Take[IntegerDigits[x = NextPrime[p*10^k]], IntegerLength[p]], k += 1]; x, {i, 18}] (* Jayanta Basu, Aug 09 2013 *)
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Amarnath Murthy, Mar 10 2002
EXTENSIONS
More terms from Sascha Kurz, Mar 17 2002
Extended by Jayanta Basu, Aug 09 2013
STATUS
approved