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.
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.
Terms
- a(0) =2a(1) =3a(2) =7a(3) =5a(4) =13a(5) =29a(6) =31a(7) =23a(8) =19a(9) =17a(10) =8209a(11) =8273a(12) =10321a(13) =2129a(14) =2131a(15) =83a(16) =67a(17) =71a(18) =79a(19) =1103a(20) =1039a(21) =1031a(22) =1063a(23) =1061a(24) =1069a(25) =263213a(26) =263209a(27) =263201a(28) =265249a(29) =265313
External references
- oeis: A059459