|
Search: id:A120642
|
|
|
| A120642 |
|
Smallest integer k>0 such that k*10^n - 1 is a prime. |
|
+0 1
|
|
| 2, 2, 2, 5, 2, 3, 2, 8, 11, 6, 11, 35, 6, 5, 15, 14, 11, 21, 3, 21, 14, 6, 6, 80, 8, 2, 2, 6, 9, 48, 48, 21, 15, 6, 44, 11, 9, 15, 18, 6, 33, 30, 3, 278, 74, 92, 89, 33, 8, 71, 59, 11, 2, 5, 3, 24, 108, 47, 39, 41, 6, 14, 53, 173, 26, 26, 51, 114, 23, 17, 246, 44, 6, 131, 56, 8, 26, 77, 74
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
The primes are 19, 199, 1999, 49999, 199999, 2999999,
19999999, 799999999, 10999999999, 59999999999, ...,.
|
|
MATHEMATICA
|
f[n_] := Block[{k = 1}, While[ !PrimeQ[k*10^n - 1], k++ ]; k]; Array[f, 79] (* Robert G. Wilson v *)
|
|
CROSSREFS
|
Cf. A030430, A037071, A062800, A065582, A121172.
Sequence in context: A115281 A130155 A113516 this_sequence A095370 A046053 A080348
Adjacent sequences: A120639 A120640 A120641 this_sequence A120643 A120644 A120645
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jonathan Vos Post (jvospost2(AT)yahoo.com), Aug 17 2006
|
|
EXTENSIONS
|
a(11) onwards from Robert G. Wilson v, Aug 20 2006
|
|
|
Search completed in 0.002 seconds
|