|
| |
|
|
A108818
|
|
Primes such that the outer 2 digits are n and n+1 and all inner digits are 1, where 0 < n < 9.
|
|
0
| |
|
|
617, 2113, 81119, 21111113, 81111119, 8111111119, 21111111111113, 81111111111111111119, 81111111111111111111119, 2111111111111111111111113, 2111111111111111111111111111113, 611111111111111111111111111111117
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
FORMULA
| a(x) = 10^(x+1)*n+floor(10^x/9)*10+n+1. Output if a(x) is prime.
|
|
|
PROG
| (PARI) n10np1(n) = { local(x, y, k); for(x=1, n, for(k=1, 8, y=10^(x+1)*k+floor(10^x/9)*10+k+1; if(isprime(y), print1(y", ")) ) ) }
|
|
|
CROSSREFS
| Sequence in context: A191938 A195809 A190029 * A020377 A118467 A200812
Adjacent sequences: A108815 A108816 A108817 * A108819 A108820 A108821
|
|
|
KEYWORD
| easy,nonn,base
|
|
|
AUTHOR
| Cino Hilliard (hillcino368(AT)gmail.com), Jul 11 2005
|
| |
|
|
