|
|
A230297
|
|
a(n) = A010062(n) written in binary: a(n+1) = a(n) + hammingweight(a(n)) in binary.
|
|
4
|
|
|
1, 10, 11, 101, 111, 1010, 1100, 1110, 10001, 10011, 10110, 11001, 11100, 11111, 100100, 100110, 101001, 101100, 101111, 110100, 110111, 111100, 1000000, 1000001, 1000011, 1000110, 1001001, 1001100, 1001111, 1010100, 1010111, 1011100, 1100000, 1100010, 1100101, 1101001, 1101101, 1110010, 1110110, 1111011, 10000001, 10000011
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Is there any way to tell by looking at a binary number whether or not it is a term of this sequence?
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
s[0] = 1; s[n_] := s[n] = s[n-1] + DigitCount[s[n-1], 2, 1]; Table[FromDigits[IntegerDigits[s[n], 2]], {n, 0, 50}] (* Amiram Eldar, Jul 28 2023 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|