The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #7 Jul 11 2015 00:12:53
%S 10,11,111,101,1101,11101,11111,10111,10011,10001,10000000010001,
%T 10000001010001,10100001010001,100001010001,100001010011,1010011,
%U 1000011,1000111,1001111,10001001111,10000001111,10000000111,10000100111
%N 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.
%C This is the lexicographically least (in positions of the flipped bits) such sequence.
%C It is not known if the sequence is infinite.
%p See A059459 for Maple program.
%Y The decimal sequence is given in A059459. A base-ten analog is in A059471.
%K nice,nonn,base
%O 1,1
%A _Gregory Allen_, Feb 02 2001
%E More terms from _David W. Wilson_, Feb 05 2001. For many further terms (but written in base 10) see A059459.