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,1

Comments

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

It is not known if the sequence is infinite.

Links

Table of n, a(n) for n=1..23.

Maple

See A059459 for Maple program.

Crossrefs

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

Sequence in context: A164370 A287948 A287626 * A063697 A058943 A222473

Adjacent sequences: A059455 A059456 A059457 * A059459 A059460 A059461

Keyword

nice,nonn,base

Author

Gregory Allen, Feb 02 2001

Extensions

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

Status

approved