|
Search: id:A071066
|
|
|
| A071066 |
|
Palindromic prime pyramid with a(1)=2 such that (number of digits in a(n+1)) = (number of digits in a(n)) + 6; a(n) is as small as possible. |
|
+0
1
|
|
| 2, 3002003, 3303002003033, 9303303002003033039, 7609303303002003033039067, 3007609303303002003033039067003, 9003007609303303002003033039067003009, 3819003007609303303002003033039067003009183
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
G. L. Honaker Jr. and C. Caldwell conjectured that this pyramid has a finite number of terms (about 193 terms).
|
|
REFERENCES
|
G. L. Honaker Jr. and C. Caldwell, Palindromic prime pyramids.J.Recreational mathematics, vol. 30.3, pp. 169-176,1999-2000
J.-P. Delahaye, "Pour la science", (French edition of Scientific American), Juin 2002, p. 99
|
|
CROSSREFS
|
Cf. A070927, A070922.
Sequence in context: A051118 A124368 A037051 this_sequence A137601 A133495 A121390
Adjacent sequences: A071063 A071064 A071065 this_sequence A071067 A071068 A071069
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), May 26 2002
|
|
|
Search completed in 0.002 seconds
|
