|
|
A215673
|
|
a(1) = 1, a(2n) = a(n)+1, a(2n+1) = a(n)+a(n+1)+1.
|
|
5
|
|
|
1, 2, 4, 3, 7, 5, 8, 4, 11, 8, 13, 6, 14, 9, 13, 5, 16, 12, 20, 9, 22, 14, 20, 7, 21, 15, 24, 10, 23, 14, 19, 6, 22, 17, 29, 13, 33, 21, 30, 10, 32, 23, 37, 15, 35, 21, 28, 8, 29, 22, 37, 16, 40, 25, 35, 11, 34, 24, 38, 15, 34, 20, 26, 7, 29, 23, 40, 18, 47, 30
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
In the S.-H. Cha reference this is function fog_2(n).
|
|
LINKS
|
|
|
MAPLE
|
a:= proc(n) option remember; 1+ `if`(n=1, 0,
`if`(irem(n, 2, 'r')=0, a(r), a(r)+a(r+1)))
end:
|
|
MATHEMATICA
|
a[1] = 1;
a[n_] := a[n] = If[EvenQ[n], a[n/2] + 1, a[(n-1)/2] + a[(n-1)/2 + 1] + 1];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|