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.

A262532 Minimal nested palindromic primes with seed 00000.

This page as a plain text file.
%I A262532 #14 Nov 03 2015 07:29:29
%S A262532 140000041,31400000413,9314000004139,74931400000413947,
%T A262532 3749314000004139473,937493140000041394739,3693749314000004139473963,
%U A262532 10369374931400000413947396301,351036937493140000041394739630153,7035103693749314000004139473963015307
%N A262532 Minimal nested palindromic primes with seed 00000.
%C A262532 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 A252532, the seed is not an integer, so that the offset is 2.)
%H A262532 Clark Kimberling, <a href="/A262532/b262532.txt">Table of n, a(n) for n = 2..200</a>
%e A262532 As a triangle:
%e A262532           00000
%e A262532         140000041
%e A262532        31400000413
%e A262532       9314000004139
%e A262532     74931400000413947
%e A262532    3749314000004139473
%e A262532   937493140000041394739
%t A262532 s0 = "00000"; 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 A262532 (* _Peter J. C. Moses_, Sep 23 2015 *)
%Y A262532 Cf. A261881.
%K A262532 nonn,base,easy
%O A262532 2,1
%A A262532 _Clark Kimberling_, Sep 24 2015