|
| |
|
|
A046210
|
|
Smallest palindromic prime that generates a palindromic prime pyramid of height n.
|
|
3
| | |
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Let p be palindromic prime; look for smallest palindromic prime that has previous term as a centered substring and has 2 more digits; repeat until no such palindromic prime can be found; then height(p) = number of rows in pyramid.
Each row of pyramid must be the smallest prime that can be used.
|
|
|
LINKS
| Author?, MAA Online
|
|
|
EXAMPLE
| Example: 16361 1163611 311636113 33116361133 3331163611333 333311636113333, stop; height(16361)=6.
|
|
|
CROSSREFS
| Cf. A034276.
Sequence in context: A015603 A184280 A157718 * A100757 A099677 A142187
Adjacent sequences: A046207 A046208 A046209 * A046211 A046212 A046213
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| Felice Russo (frusso(AT)micron.com), Jan 25 2000
|
| |
|
|
