Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Sep 29 2015 12:33:08
%S 0,101,31013,3310133,933101339,1093310133901,30109331013390103,
%T 333010933101339010333,33330109331013390103333,
%U 993333010933101339010333399,104993333010933101339010333399401,7810499333301093310133901033339940187
%N Minimal nested palindromic primes with seed 0.
%C Let s be a palindrome and put a(1) = s. Let a(2) be the least palindromic prime having s in the middle; for n > 2, let a(n) be the least palindromic prime having a(n-1) in the middle. Then (a(n)) is the sequence of minimal nested palindromic primes with seed s.
%C Guide to related sequences:
%C seed sequence
%C 0 A261881
%C 1 A261818
%C 2 A053600
%C 3 A082563
%C 4 A261821
%C 5 A261822
%C 6 A261823
%C 7 A261824
%C 8 A261825
%C 9 A261826
%C 000 A262531
%C 0^5 A262532
%C 0^7 A262533
%C 0^9 A260250
%C 010 A260459
%C 111 A261820
%C 1^5 A262497
%C 1^7 A262498
%C 1^9 A262499
%H Clark Kimberling, <a href="/A261881/b261881.txt">Table of n, a(n) for n = 1..300</a>
%e As a triangle:
%e ........0
%e .......101
%e ......31013
%e .....3310133
%e ....933101339
%e ..1093310133901
%e 30109331013390103
%t s = {0}; Do[NestWhile[# + 1 &, 1, ! PrimeQ[tmp = FromDigits[Join[#, IntegerDigits[Last[s]], Reverse[#]] &[IntegerDigits[#]]]] &]; AppendTo[s, tmp], {15}]; s
%t (* _Peter J. C. Moses_, Sep 01 2015 *)
%Y Cf. A261818.
%K nonn,easy,base
%O 1,2
%A _Clark Kimberling_, Sep 23 2015