A261881 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A261881

Minimal nested palindromic primes with seed 0.

0, 101, 31013, 3310133, 933101339, 1093310133901, 30109331013390103, 333010933101339010333, 33330109331013390103333, 993333010933101339010333399, 104993333010933101339010333399401, 7810499333301093310133901033339940187

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

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 having a(n-1) in the middle. Then (a(n)) is the sequence of minimal nested palindromic primes with seed s.

Guide to related sequences:

seed sequence

0 A261881

1 A261818

2 A053600

3 A082563

4 A261821

5 A261822

6 A261823

7 A261824

8 A261825

9 A261826

000 A262531

0^5 A262532

0^7 A262533

0^9 A260250

010 A260459

111 A261820

1^5 A262497

1^7 A262498

1^9 A262499

LINKS

Clark Kimberling, Table of n, a(n) for n = 1..300

EXAMPLE

As a triangle:

........0

.......101

......31013

.....3310133

....933101339

..1093310133901

30109331013390103

MATHEMATICA

s = {0}; 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

Cf. A261818.

Sequence in context: A153807 A327741 A183056 * A262633 A261966 A076127

Adjacent sequences: A261878 A261879 A261880 * A261882 A261883 A261884

KEYWORD

nonn,easy,base

AUTHOR

Clark Kimberling, Sep 23 2015

STATUS

approved