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.

A262533 Minimal nested palindromic primes with seed 0000000.

This page as a plain text file.
%I A262533 #9 Oct 02 2015 13:09:37
%S A262533 19000000091,1190000000911,36119000000091163,953611900000009116359,
%T A262533 9095361190000000911635909,790953611900000009116359097,
%U A262533 1479095361190000000911635909741,72147909536119000000091163590974127,10572147909536119000000091163590974127501
%N A262533 Minimal nested palindromic primes with seed 0000000.
%C A262533 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 A260444, the seed is not an integer, so that the offset is 2.)
%H A262533 Clark Kimberling, <a href="/A262533/b262533.txt">Table of n, a(n) for n = 2..200</a>
%e A262533 As a triangle:
%e A262533             0000000
%e A262533           19000000091
%e A262533          1190000000911
%e A262533        36119000000091163
%e A262533      953611900000009116359
%e A262533    9095361190000000911635909
%e A262533   790953611900000009116359097
%t A262533 s0 = "0000000"; 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 A262533 (* _Peter J. C. Moses_, Sep 23 2015 *)
%Y A262533 Cf. A261881.
%K A262533 nonn,base,easy
%O A262533 2,1
%A A262533 _Clark Kimberling_, Sep 24 2015