login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054262 Start with the prime 11; next prime must exceed previous prime and start with last digit of previous prime. 2
11, 13, 31, 101, 103, 307, 701, 1009, 9001, 10007, 70001, 100003, 300007, 700001, 1000003, 3000017, 7000003, 30000001, 100000007, 700000001, 1000000007, 7000000001, 10000000019, 90000000019, 90000000023, 300000000077 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

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

C. Rivera, Puzzle 45 - Prime Solitaire

PROG

(PARI) nxtprm(fp) = {fd = digits(fp); ld = fd[#fd]; forprime(p = fp+1, , nd = digits(p); if ((nd[1] == ld) , return (p))); }

lista(nn) = {fp = 1; for (n=1, nn, np = nxtprm(fp); print1(np, ", "); fp = np; ); }

CROSSREFS

Cf. A053649 (similar sequence without 0 digits).

Sequence in context: A262254 A082238 A179551 * A053649 A104151 A088263

Adjacent sequences:  A054259 A054260 A054261 * A054263 A054264 A054265

KEYWORD

easy,nonn,base

AUTHOR

Patrick De Geest, Feb 15 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 11 21:15 EST 2017. Contains 295919 sequences.