login
A090927
Smallest prime beginning with prime(n) and having as many digits.
2
23, 307, 50021, 7000003, 11000000021, 1300000000021, 17000000000000009, 1900000000000000009, 23000000000000000000003, 29000000000000000000000000023, 3100000000000000000000000000291
OFFSET
1,1
LINKS
FORMULA
Let p(n)=prime(n). If f:R->R is a continuous, everywhere-increasing function, such that f(x)=p(x) for every natural x and F = f^(-1) and if a(n) exists, then a(n) = p(ceiling(F(p(n)*(10^(p(n)-floor(log_10 p(n))-1))))). - Sam Alexander, Dec 31 2003
MATHEMATICA
sp[n_]:=Module[{p = Prime[n]}, NextPrime[p*10^(p - IntegerLength[p])]]; Array[ sp, 20] (* Harvey P. Dale, May 07 2017 *)
CROSSREFS
Sequence in context: A267266 A077504 A086558 * A045530 A080188 A142433
KEYWORD
base,easy,nonn
AUTHOR
Amarnath Murthy, Dec 28 2003
EXTENSIONS
More terms from Ray Chandler, Dec 29 2003
STATUS
approved