A059458 A binary sequence: a(1) = 10 (2 in decimal) and a(n+1) is obtained by trying to complement just one bit of a(n), starting with the least significant bit, until a new prime is reached.

10, 11, 111, 101, 1101, 11101, 11111, 10111, 10011, 10001, 10000000010001, 10000001010001, 10100001010001, 100001010001, 100001010011, 1010011, 1000011, 1000111, 1001111, 10001001111, 10000001111, 10000000111, 10000100111

Offset: 1

Author

Gregory Allen, Feb 02 2001

Keywords

• nice
• nonn
• base

Comments

This is the lexicographically least (in positions of the flipped bits) such sequence.

It is not known if the sequence is infinite.

Crossrefs

The decimal sequence is given in A059459. A base-ten analog is in A059471.

Programs

Maple

See A059459 for Maple program.

Extensions

More terms from David W. Wilson, Feb 05 2001. For many further terms (but written in base 10) see A059459.