|
| |
|
|
A034093
|
|
Number of near-repunit primes that can be formed from R_n (A004022), that is, by changing just one digit from 1 to 0.
|
|
3
| |
|
|
0, 0, 1, 0, 1, 1, 0, 2, 1, 0, 0, 5, 0, 0, 0, 0, 2, 5, 0, 4, 0, 0, 0, 3, 0, 1, 0, 0, 1, 2, 0, 4, 1, 0, 1, 2, 0, 2, 1, 0, 0, 7, 0, 4, 0, 0, 0, 2, 0, 2, 1, 0, 1, 3, 0, 1, 0, 0, 0, 0, 0, 3, 0, 0, 0, 4, 0, 2, 0, 0, 0, 3, 0, 1, 0, 0, 1, 3, 0, 1, 0, 0, 1, 3, 0, 3, 0, 0, 1, 1, 0, 1, 0, 0, 0, 2, 0, 3, 0, 0
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,8
|
|
|
REFERENCES
| C. K. Caldwell and H. Dubner, The near repunits primes, J. Rec. Math., Vol. 27(1), 35-41. 1995.
|
|
|
LINKS
| Chris Caldwell, Below are all of the 12-digit Near-Repunit primes:
Chris Caldwell, Repunits
|
|
|
EXAMPLE
| a(12) = 5 because from (10^12 -1)/9 = 111111111111, by changing just one digit from 1 to 0, out of the eleven candidates, 111111111101, 111111110111, 111111011111, 111011111111 and 101111111111 are primes.
|
|
|
MATHEMATICA
| a = {}; Do[ p = IntegerDigits[ (10^n - 1)/9 ]; c = 0; Do[ If[ q = FromDigits[ ReplacePart[p, 0, i]]; PrimeQ[q], c++ ], {i, 2, n} ]; a = Append[a, c], {n, 1, 100} ]; a - Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 19 2001
|
|
|
CROSSREFS
| Cf. A004022, A065074, A065083.
Sequence in context: A192396 A094449 A136129 * A057150 A185663 A105868
Adjacent sequences: A034090 A034091 A034092 * A034094 A034095 A034096
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| Felice Russo (frusso(AT)micron.com)
|
|
|
EXTENSIONS
| More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 19 2001
Edited by N. J. A. Sloane (njas(AT)research.att.com), Oct 02 2008 at the suggestion of R. J. Mathar
|
| |
|
|
