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.
a(6) = 130003 begins with prime(6) = 13 and has 6 digits.
Prepend[NextPrime[FromDigits[PadRight[IntegerDigits[#],PrimePi[#]]]]&/@Prime[Range[2,25]],2] (* Harvey P. Dale, Jan 09 2011 *)
a(n) = my(p=prime(n), d=digits(p)); c=nextprime(p*10^(n-#d)); cd=digits(c); if(vector(#d, i, cd[i]) == d, return(c), return(0)) \\ David A. Corneth, Apr 13 2019
from sympy import prime, nextprime def A088104(n): p = prime(n) return nextprime(p*10**(n-len(str(p)))-1) # Chai Wah Wu, Jun 18 2019
a(2) = 2 since 31 and 37 are the only two 2-digit primes beginning with prime(2) = 3.
A088754(n)={ local (resul,sdig,p,lo,hi) ; sdig=prime(n) ; lo=sdig ; hi=sdig+1 ; while( lo < 10^(n-1), lo *= 10 ; hi *= 10 ; ) ; resul=0 ; p=nextprime(lo) ; while(p < hi, resul++ ; p=nextprime(p+1) ; ) ; return(resul) ; } { for(n=1,11, print(A088754(n)); ) } \\ R. J. Mathar, Sep 25 2006
from sympy import prime, primepi def A088754(n): p = prime(n) m = n-len(str(p)) return primepi((p+1)*10**m)-primepi(p*10**m) # Chai Wah Wu, Jun 18 2019
a(6) =3 = 130003 - 130000.
a(2) = 2 since 23 and 29 are the only two 2-digit primes beginning with 2.
Comments