|
Search: id:A085824
|
|
|
| A085824 |
|
Smallest prime containing exactly n 0's (A037053) requiring only the two exterior digits. |
|
+0
2
|
|
| 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 26, 27, 28, 30, 34, 35, 36, 37, 38, 39, 41, 44, 45, 48, 51, 52, 54, 55, 56, 57, 59, 61, 64, 66, 68, 77, 80, 83, 85, 97, 99, 100, 102, 103, 104, 106, 109, 111, 112, 114, 119, 120, 122, 127, 128
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
In fact in the first one thousand primes containing exactly n zeros, 140 use just two digits. 1008 is in the sequence.
Although this sequence probably thins out like the primes, it is infinite.
|
|
MATHEMATICA
|
y[n_] := Block[{p = Join[ {x}, Table[ 0, {i, 1, n}], {y} ], c = Table[ j, {j, 1, 9}], q = {}}, Do[q = Append[q, Replace[p, { x -> c[[i]], y -> c[[j]]}, 2]], {i, 1, 9}, {j, 1, 9}]; r = Min[ Select[ FromDigits /@ q, PrimeQ[ # ] & ]]; Select[ Range[250], y[ # ] == 0 & ]
|
|
CROSSREFS
|
Cf. A037053.
Sequence in context: A023806 A113763 A023754 this_sequence A014157 A026467 A088185
Adjacent sequences: A085821 A085822 A085823 this_sequence A085825 A085826 A085827
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 04 2003
|
|
EXTENSIONS
|
Jul 09 2003: Zakir Seidov comments that the Mma program is incorrect. The sequence should be recheked.
|
|
|
Search completed in 0.002 seconds
|
