The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A262373 a(1)=2, a(2)=5, a(3)=3; for n>3, a(n) is the smallest prime that has not already appeared and ends with the first digit in a(n-1) that equals 1, 3, 7 or 9. 2
 2, 5, 3, 13, 11, 31, 23, 43, 53, 73, 7, 17, 41, 61, 71, 37, 83, 103, 101, 131, 151, 181, 191, 211, 241, 251, 271, 47, 67, 97, 19, 281, 311, 113, 331, 163, 401, 421, 431, 173, 461, 491, 29, 59, 79, 107, 521, 541, 571, 127, 601, 631, 193, 641, 661, 691, 89, 109 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Using Sierpiński's theorems [Sierpiński] (see also [Trost]), it is easy to see that the sequence is a permutation of the sequence of primes (A000040). REFERENCES W. Sierpiński, Sur l'existence de nombres premiers avec une suite arbitraire de chiffres initiaux, Le Matematiche Catania, 1951. E. Trost, Primzahlen, Verlag Birkhauser, 1953, Theorems 20 - 21. LINKS Peter J. C. Moses, Table of n, a(n) for n = 1..5000 CROSSREFS Cf. A000040, A249974. Sequence in context: A242171 A254790 A091265 * A028415 A211306 A267101 Adjacent sequences:  A262370 A262371 A262372 * A262374 A262375 A262376 KEYWORD nonn,base AUTHOR Vladimir Shevelev, Sep 20 2015 EXTENSIONS a(46) corrected by Peter J. C. Moses, Sep 24 2015 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 17 21:11 EDT 2021. Contains 343990 sequences. (Running on oeis4.)