A262283 - cp's OEIS frontend

A262283 a(1)=2. For n>1, let s denote the digit-string of a(n-1) with the first digit omitted. Then a(n) is the smallest prime not yet present which starts with s.

n	a(n)
1	2
2	3
3	5
4	7
5	11
6	13
7	31
8	17
9	71
10	19
11	97
12	73
13	37
14	79
15	907
16	701
17	101
18	103
19	307
20	709
21	911
22	113
23	131
24	311
25	1103
26	1031
27	313
28	137
29	373
30	733
31	331
32	317
33	173
34	739
35	397
36	971
37	719
38	191
39	919
40	193
41	937
42	379
43	797
44	977
45	773
46	7307
47	3079
48	7901
49	9011
50	1109
51	109
52	929
53	29
54	941
55	41

[2, 3, 5, 7, 11, 13, 31, 17, 71, 19, 97, 73, 37, 79, 907, 701, 101, 103, 307, 709, 911, 113, 131, 311, 1103, 1031, 313, 137, 373, 733, 331, 317, 173, 739, 397, 971, 719, 191, 919, 193, 937, 379, 797, 977, 773, 7307, 3079, 7901, 9011, 1109, 109, 929, 29, 941, 41]

cp's OEIS Frontend

A262283 a(1)=2. For n>1, let s denote the digit-string of a(n-1) with the first digit omitted. Then a(n) is the smallest prime not yet present which starts with s.

Table of values

List of values