This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A059458 #7 Jul 11 2015 00:12:53 %S A059458 10,11,111,101,1101,11101,11111,10111,10011,10001,10000000010001, %T A059458 10000001010001,10100001010001,100001010001,100001010011,1010011, %U A059458 1000011,1000111,1001111,10001001111,10000001111,10000000111,10000100111 %N 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. %C A059458 This is the lexicographically least (in positions of the flipped bits) such sequence. %C A059458 It is not known if the sequence is infinite. %p A059458 See A059459 for Maple program. %Y A059458 The decimal sequence is given in A059459. A base-ten analog is in A059471. %K A059458 nice,nonn,base %O A059458 1,1 %A A059458 _Gregory Allen_, Feb 02 2001 %E A059458 More terms from _David W. Wilson_, Feb 05 2001. For many further terms (but written in base 10) see A059459.