|
|
A080439
|
|
a(1) = 11, a(n) is the 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)=10000000000060571 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 11, a 2-digit number, and holds true at least till a(12). - Julio Cesar Hernandez-Castro, Jul 05 2011
|
|
LINKS
|
|
|
EXAMPLE
|
a(2) = 101 and a(3) is obtained by inserting a '0' and a '6' in the two inner spaces of 101: (1,-,0,-,1).
|
|
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, 11, 6]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|