|
Search: id:A080439
|
|
|
| A080439 |
|
a(1) = 11, a(n) = smallest prime obtained by inserting digits between every pair of digits of a(n-1). |
|
+0
4
|
|
| 11, 101, 10061, 100000651, 10000000000060571, 100000000000000000000000600052761, 10000000000000000000000000000000000000000000000060000000502271641
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Conjecture: Only one digit needs to be inserted between each pair of digit of a(n-1) to get a(n); i.e. a(n) contains exactly 2n-1 digits for n > 1.
|
|
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
|
Cf. A080440, A080441, A080442, A080883 - A080914.
Sequence in context: A075767 A080176 A064490 this_sequence A098153 A020449 A089971
Adjacent sequences: A080436 A080437 A080438 this_sequence A080440 A080441 A080442
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 22 2003
|
|
EXTENSIONS
|
Edited, corrected and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 22 2003
|
|
|
Search completed in 0.002 seconds
|
