|
Search: id:A108826
|
|
|
| A108826 |
|
Primes such that the outer 2 digits are n and n+1 and all inner digits are 8, where 0 < n < 9. |
|
+0
1
|
|
| 283, 28888883, 88888888888889, 88888888888888889, 28888888888888888888888888883, 6888888888888888888888888888888887, 88888888888888888888888888888888889
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
a(x) = 10^(x+1)*n+floor(10^x*8/9)*10+n+1. Output if a(x) is prime.
|
|
PROGRAM
|
(PARI) n10np1(n) = { local(x, y, k); for(x=1, n, for(k=1, 8, y=10^(x+1)*k+floor(10^x*8/9)*10+k+1; if(isprime(y), print1(y", ")) ) ) }
|
|
CROSSREFS
|
Sequence in context: A059257 A142837 A064964 this_sequence A061310 A092681 A090789
Adjacent sequences: A108823 A108824 A108825 this_sequence A108827 A108828 A108829
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Jul 11 2005
|
|
|
Search completed in 0.002 seconds
|
