A053649 Start with the prime 11; next prime must exceed previous prime, contain no 0's and start with last digit of previous prime.

11, 13, 31, 113, 311, 1117, 7121, 11113, 31121, 111119, 911111, 1111151, 1111157, 7111123, 31111121, 111111113, 311111131, 1111111121, 1111111139, 9111111127, 71111111147, 71111111243, 311111111111, 1111111111139, 9111111111211

Offset

0,1

Links

Table of n, a(n) for n=0..24.

C. Rivera, Puzzle 45 - Prime Solitaire

Example

a(4)=113, so a(5)=311 because a(5) must be greater than a(4) and have no zero digit and the last digit, 3, of 113 must link to the first digit, 3, of 311.

Prog

(PARI) nxtprm(fp) = {fd = digits(fp); ld = fd[#fd]; forprime(p = fp+1, , nd = digits(p); if ((nd[1] == ld) && (vecmin(nd) != 0), return (p))); }
lista(nn) = {fp = 1; for (n=1, nn, np = nxtprm(fp); print1(np, ", "); fp = np; ); } \\ Michel Marcus, Jun 06 2014

Crossrefs

Cf. A054262 (similar sequence without the 0 digit condition).

Sequence in context: A082238 A179551 A054262 * A104151 A088263 A334556

Adjacent sequences: A053646 A053647 A053648 * A053650 A053651 A053652

Keyword

easy,nonn,base

Author

Enoch Haga, Feb 18 2000

Extensions

More terms from Patrick De Geest, Feb 15 2000

Status

approved