|
Search: id:A059458
|
|
|
| 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. |
|
+0
5
|
|
| 10, 11, 111, 101, 1101, 11101, 11111, 10111, 10011, 10001, 10000000010001, 10000001010001, 10100001010001, 100001010001, 100001010011, 1010011, 1000011, 1000111, 1001111, 10001001111, 10000001111, 10000000111, 10000100111
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
This is the lexicographically least (in positions of the flipped bits) such sequence.
It is not known if the sequence is infinite.
|
|
MAPLE
|
See A059459 for Maple program.
|
|
CROSSREFS
|
The decimal sequence is given in A059459. A base ten analogue is in A059471.
Sequence in context: A094026 A035526 A164370 this_sequence A058943 A041217 A041218
Adjacent sequences: A059455 A059456 A059457 this_sequence A059459 A059460 A059461
|
|
KEYWORD
|
nice,nonn,base
|
|
AUTHOR
|
Gregory Allen (jukebox_999(AT)hotmail.com), Feb 02 2001
|
|
EXTENSIONS
|
More terms from David W. Wilson (davidwwilson(AT)comcast.net), Feb 05 2001. For many further terms (but written in base 10) see A059459.
|
|
|
Search completed in 0.002 seconds
|
