A249974 - cp's OEIS frontend

A249974 a(1)=1; otherwise, find the first digit from the left in a(n-1) which is 1, 3, 7 or 9. Omitting the digits before this one, we reverse the remaining digits, obtaining s, say. Then a(n) is the smallest prime which ends with s and has not already appeared.

n	a(n)
1	1
2	11
3	211
4	311
5	2113
6	2311
7	5113
8	6311
9	6113
10	8311
11	11113
12	131111
13	3111131
14	21311113
15	63111131
16	31311113
17	31111313
18	531311113
19	1131111313
20	273131111311
21	311311113137
22	5731311113113
23	6311311113137
24	12731311113113
25	2331131111313721

[1, 11, 211, 311, 2113, 2311, 5113, 6311, 6113, 8311, 11113, 131111, 3111131, 21311113, 63111131, 31311113, 31111313, 531311113, 1131111313, 273131111311, 311311113137, 5731311113113, 6311311113137, 12731311113113, 2331131111313721]

cp's OEIS Frontend

A249974 a(1)=1; otherwise, find the first digit from the left in a(n-1) which is 1, 3, 7 or 9. Omitting the digits before this one, we reverse the remaining digits, obtaining s, say. Then a(n) is the smallest prime which ends with s and has not already appeared.

Table of values

List of values