|
Search: id:A046210
|
|
|
| A046210 |
|
Smallest palindromic prime that generates a palindromic prime pyramid of height n. |
|
+0
4
|
|
| 11, 131, 2, 929, 10301, 16361, 10281118201, 35605550653, 7159123219517
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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: A015602 A015603 A157718 this_sequence A100757 A099677 A142187
Adjacent sequences: A046207 A046208 A046209 this_sequence A046211 A046212 A046213
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Felice Russo (felice.russo(AT)katamail.com), Jan 25 2000
|
|
|
Search completed in 0.002 seconds
|
