login
A171987
Best explained by example: in the binary representation, start with 10000, then add 1 and push the 1 to the left: 10001, 10010, 10100, 11000, then add another one, 11001, 11010, 11100, etc: 11101, 11110, 11111. Then proceed with the next length of numbers: 100000, etc.
1
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 20, 24, 25, 26, 28, 29, 30, 31, 32, 33, 34, 36, 40, 48, 49, 50, 52, 56, 57, 58, 60, 61, 62, 63, 64, 65, 66, 68, 72, 80, 96, 97, 98, 100, 104, 112, 113, 114, 116, 120, 121, 122, 124, 125, 126, 127, 128, 129, 130, 132, 136, 144, 160, 192, 193, 194, 196, 200
OFFSET
1,2
COMMENTS
Numbers of the form (2^k - 1)*2^l + 2^m, where k >= 0, l > m >= 0. - Ivan Neretin, Jul 26 2015
LINKS
MATHEMATICA
Nest[If[EvenQ[l = #[[-1]]], Join[#, l + 2^(Range[IntegerExponent[l, 2]] - 1)], Append[#, l + 1]] &, {1}, 21] (* Ivan Neretin, Jul 26 2015 *)
CROSSREFS
Sequence in context: A374519 A328869 A004744 * A332111 A072226 A247809
KEYWORD
nonn,base
AUTHOR
Stefan Maubach (s.maubach(AT)science.ru.nl), Jan 21 2010
STATUS
approved