A262350 - cp's OEIS frontend

A262350 a(1) = 2. For n>1, let s denote the binary string of a(n-1) with the leftmost 1 and following consecutive 0's removed. Then a(n) is the smallest prime not yet present whose binary representation begins with s.

n	a(n)
1	2
2	3
3	5
4	7
5	13
6	11
7	29
8	53
9	43
10	23
11	31
12	61
13	59
14	109
15	181
16	107
17	173
18	367
19	223
20	191
21	127
22	509
23	1013
24	4013
25	3931
26	3767
27	13757
28	11131
29	2939
30	1783
31	3037
32	1979
33	3821
34	3547
35	1499
36	1901
37	877
38	2927
39	1759
40	1471
41	1789
42	1531
43	2029
44	2011
45	7901
46	60887
47	56239
48	93887
49	28351

[2, 3, 5, 7, 13, 11, 29, 53, 43, 23, 31, 61, 59, 109, 181, 107, 173, 367, 223, 191, 127, 509, 1013, 4013, 3931, 3767, 13757, 11131, 2939, 1783, 3037, 1979, 3821, 3547, 1499, 1901, 877, 2927, 1759, 1471, 1789, 1531, 2029, 2011, 7901, 60887, 56239, 93887, 28351]

cp's OEIS Frontend

A262350 a(1) = 2. For n>1, let s denote the binary string of a(n-1) with the leftmost 1 and following consecutive 0's removed. Then a(n) is the smallest prime not yet present whose binary representation begins with s.

Table of values

List of values