|
|
A309674
|
|
a(1) = 1, a(n) = hamming_weight(Sum_{k=1..n-1} a(k) ) for n>=2.
|
|
1
|
|
|
1, 1, 1, 2, 2, 3, 2, 2, 3, 2, 3, 3, 3, 3, 5, 2, 3, 3, 3, 5, 3, 5, 4, 1, 2, 3, 3, 3, 3, 5, 3, 5, 4, 2, 3, 4, 4, 5, 4, 5, 6, 2, 3, 3, 3, 3, 5, 3, 5, 4, 2, 3, 4, 4, 5, 4, 5, 6, 3, 3, 5, 4, 3, 5, 4, 5, 4, 5, 5, 7, 6, 6, 2, 2, 3, 3, 3, 5, 3, 5, 4, 2, 3, 4, 4, 5, 4, 5, 6, 3, 3, 5, 4, 3, 5, 4, 5, 4, 5, 5, 7, 6, 6
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
b:= proc(n) option remember; `if`(n=0, 0, a(n)+b(n-1)) end:
a:= n-> `if`(n=1, 1, add(i, i=Bits[Split](b(n-1)))):
|
|
MATHEMATICA
|
a[1] = 1; s[n_] := Sum[a[k], {k, 1, n - 1}]; a[n_] := a[n] = DigitCount[s[n], 2, 1]; Array[a, 100] (* Amiram Eldar, Jul 27 2023 *)
|
|
PROG
|
(PARI) { my(s=0, t=1); for(j=1, 100, print1(t, ", "); s+=t; t=hammingweight(s)); } \\ Joerg Arndt, Aug 30 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|