cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A262531 Minimal nested palindromic primes with seed 000.

This page as a plain text file.
%I A262531 #11 Oct 02 2015 13:09:08
%S A262531 1300031,10130003101,171013000310171,91710130003101719,
%T A262531 3917101300031017193,16391710130003101719361,
%U A262531 10116391710130003101719361101,191011639171013000310171936110191,91910116391710130003101719361101919,119191011639171013000310171936110191911
%N A262531 Minimal nested palindromic primes with seed 000.
%C A262531 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. (For A261819, the seed is not an integer, so that the offset is 2.)
%H A262531 Clark Kimberling, <a href="/A262531/b262531.txt">Table of n, a(n) for n = 2..200</a>
%e A262531 As a triangle:
%e A262531           000
%e A262531         1300031
%e A262531       10130003101
%e A262531     171013000310171
%e A262531    91710130003101719
%e A262531   3917101300031017193
%e A262531 16391710130003101719361
%t A262531 s0 = "000"; s = {ToExpression[s0]};Do[NestWhile[# + 1 &, 1, ! PrimeQ[tmp = FromDigits[Join[#, IntegerDigits[Last[s], 10, Max[StringLength[s0],Length[IntegerDigits[Last[s]]]]], Reverse[#]]&[IntegerDigits[#]]]] &]; AppendTo[s, tmp], {10}]; s0 <> ", " <> StringTake[ToString[Rest[s]], {2, -2}]
%t A262531 (* _Peter J. C. Moses_, Sep 23 2015 *)
%Y A262531 Cf. A261881.
%K A262531 nonn,base,easy
%O A262531 2,1
%A A262531 _Clark Kimberling_, Sep 24 2015