|
Search: id:A108845
|
|
|
| A108845 |
|
Primes such that the outer 2 digits are n and all inner digits are 1, where 0 < n < 9. |
|
+0
1
|
|
| 313, 919, 3111111111113, 311111111111113, 1111111111111111111, 11111111111111111111111, 3111111111111111111111111111113
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
PROGRAM
|
(PARI) n10np1(n, d) = { local(x, y, k); for(x=1, n, for(k=1, 9, y=10^(x+1)*k+floor(10^x*d/9)*10+k; if(isprime(y), print1(y", ")) ) ) }
|
|
CROSSREFS
|
Sequence in context: A090514 A068681 A082436 this_sequence A123059 A083997 A164772
Adjacent sequences: A108842 A108843 A108844 this_sequence A108846 A108847 A108848
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Jul 11 2005
|
|
|
Search completed in 0.002 seconds
|
