login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A108820
Primes such that the outer 2 digits are n and n+1 and all inner digits are 3, where 0 < n < 9.
1
233, 839, 2333, 6337, 23333, 63337, 83339, 633337, 6333337, 8333333339, 23333333333, 63333333337, 83333333339, 63333333333337, 8333333333333339, 23333333333333333, 23333333333333333333333
OFFSET
1,1
COMMENTS
The first digit of each term must be 2, 6, or 8. - Harvey P. Dale, Jun 13 2020
LINKS
FORMULA
a(x) = 10^(x+1)*n+floor(10^x*3/9)*10+n+1. Output if a(x) is prime.
MATHEMATICA
Select[Sort[Flatten[Table[10FromDigits[PadRight[{i}, n, 3]]+i+1, {i, {2, 6, 8}}, {n, 2, 25}]]], PrimeQ] (* Harvey P. Dale, Jun 13 2020 *)
PROG
(PARI) n10np1(n) = { local(x, y, k); for(x=1, n, for(k=1, 8, y=10^(x+1)*k+floor(10^x*3/9)*10+k+1; if(isprime(y), print1(y", ")) ) ) }
CROSSREFS
Sequence in context: A142783 A142848 A023338 * A230392 A003537 A037033
KEYWORD
easy,nonn,base
AUTHOR
Cino Hilliard, Jul 11 2005
EXTENSIONS
Corrected by T. D. Noe, Nov 15 2006
STATUS
approved