%I A046210
%S A046210 11,131,2,929,10301,16361,10281118201,35605550653,7159123219517
%N A046210 Smallest palindromic prime that generates a palindromic prime pyramid 
               of height n.
%C A046210 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.
%C A046210 Each row of pyramid must be the smallest prime that can be used.
%H A046210 Author?, <a href="http://www.maa.org/mathland/mathtrek_08_29_05.html">
               MAA Online</a>
%e A046210 Example: 16361 1163611 311636113 33116361133 3331163611333 333311636113333, 
               stop; height(16361)=6.
%Y A046210 Cf. A034276.
%Y A046210 Sequence in context: A015602 A015603 A157718 this_sequence A100757 A099677 
               A142187
%Y A046210 Adjacent sequences: A046207 A046208 A046209 this_sequence A046211 A046212 
               A046213
%K A046210 nonn,base
%O A046210 1,1
%A A046210 Felice Russo (felice.russo(AT)katamail.com), Jan 25 2000