OFFSET
1,1
COMMENTS
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 have a(n-1) in the middle. Then (a(n)) is the sequence of minimal nested palindromic primes with seed s.
LINKS
Clark Kimberling, Table of n, a(n) for n = 1..200
EXAMPLE
As a triangle:
........6
......10601
.....3106013
...19310601391
..3193106013913
30319310601391303
MATHEMATICA
s = {6}; Do[NestWhile[# + 1 &, 1, ! PrimeQ[tmp = FromDigits[Join[#, IntegerDigits[Last[s]], Reverse[#]] &[IntegerDigits[#]]]] &]; AppendTo[s, tmp], {15}]; s
(* Peter J. C. Moses, Sep 01 2015 *)
CROSSREFS
KEYWORD
nonn,easy,base
AUTHOR
Clark Kimberling, Sep 23 2015
STATUS
approved