A059459 - cp's OEIS frontend

A059459 a(1) = 2; a(n+1) is obtained by writing a(n) in binary and trying to complement just one bit, starting with the least significant bit, until a new prime is reached.

n	a(n)
1	2
2	3
3	7
4	5
5	13
6	29
7	31
8	23
9	19
10	17
11	8209
12	8273
13	10321
14	2129
15	2131
16	83
17	67
18	71
19	79
20	1103
21	1039
22	1031
23	1063
24	1061
25	1069
26	263213
27	263209
28	263201
29	265249
30	265313
31	264289
32	280673
33	280681
34	280697
35	280699
36	280703
37	280639
38	280607
39	280603
40	280859
41	280843
42	281867
43	265483
44	265547
45	265579
46	265571
47	266083
48	266081
49	266089
50	266093
51	266029

[2, 3, 7, 5, 13, 29, 31, 23, 19, 17, 8209, 8273, 10321, 2129, 2131, 83, 67, 71, 79, 1103, 1039, 1031, 1063, 1061, 1069, 263213, 263209, 263201, 265249, 265313, 264289, 280673, 280681, 280697, 280699, 280703, 280639, 280607, 280603, 280859, 280843, 281867, 265483, 265547, 265579, 265571, 266083, 266081, 266089, 266093, 266029]

cp's OEIS Frontend

A059459 a(1) = 2; a(n+1) is obtained by writing a(n) in binary and trying to complement just one bit, starting with the least significant bit, until a new prime is reached.

Table of values

List of values