login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
2, 3002003, 3303002003033, 9303303002003033039, 7609303303002003033039067, 3007609303303002003033039067003, 9003007609303303002003033039067003009, 3819003007609303303002003033039067003009183 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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

LINKS

Table of n, a(n) for n=1..8.

CROSSREFS

Cf. A070927, A070922.

Sequence in context: A037051 A283072 A214599 * A337368 A137601 A232962

Adjacent sequences:  A071063 A071064 A071065 * A071067 A071068 A071069

KEYWORD

easy,nonn,base

AUTHOR

Benoit Cloitre, May 26 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 27 08:39 EDT 2021. Contains 347689 sequences. (Running on oeis4.)