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, 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

Offset: 1

Author

Vladimir Shevelev, Sep 20 2015

Keywords

• nonn
• base

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 Birkhäuser, 1953, Theorems 20 - 21.

Links

• Peter J. C. Moses, Table of n, a(n) for n = 1..5000

Crossrefs

Cf. A000040, A249974.

Extensions

a(46) corrected by Peter J. C. Moses, Sep 24 2015