|
| |
|
|
A080441
|
|
a(1) = 17, a(n) = smallest prime obtained by inserting digits between every pair of digits of a(n-1).
|
|
4
| | |
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Conjecture: Only one digit needs to be inserted between each pair of digits of a(n-1) to get a(n); i.e. a(n) contains exactly 2n-1 digits for n > 1.
The conjecture above is false: a(5)=10000000000003037 has 17 digits instead of 2*5-1=9. A refined conjecture is: a(n) contains exactly 2^(n-1) + 1 digits for all n>0. This follows trivially by induction from the initial conjecture above of only one digit needed between each pair, and the fact that we start with 17, a 2 digit number, and holds true at least till a(12).
|
|
|
LINKS
| Julio Cesar Hernandez-Castro, Table of n, a(n) for n = 1..12
|
|
|
MATHEMATICA
| a[n_] := Block[{d = IntegerDigits[n]}, k = Length[d]; While[k > 1, d = Insert[d, 0, k]; k-- ]; d = FromDigits[d]; e = d; k = 0; While[ !PrimeQ[e], k++; e = d + 10FromDigits[ IntegerDigits[k], 100]]; e]; NestList[a, 17, 6]
|
|
|
CROSSREFS
| Cf. A080439, A080440, A080442, A080883 - A080914.
Sequence in context: A125327 A126485 A159031 * A135400 A052254 A156851
Adjacent sequences: A080438 A080439 A080440 * A080442 A080443 A080444
|
|
|
KEYWORD
| base,nonn
|
|
|
AUTHOR
| Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 22 2003
|
|
|
EXTENSIONS
| Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 22 2003
|
| |
|
|
