login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A083537
a(0) = a(1) = 0, a(2n) = a(n)+1, a(2n+1) = a(n-1).
0
0, 0, 1, 0, 2, 0, 1, 1, 3, 0, 1, 2, 2, 0, 2, 1, 4, 1, 1, 3, 2, 0, 3, 1, 3, 2, 1, 2, 3, 0, 2, 2, 5, 1, 2, 4, 2, 1, 4, 1, 3, 3, 1, 2, 4, 0, 2, 3, 4, 1, 3, 3, 2, 2, 3, 1, 4, 2, 1, 3, 3, 0, 3, 2, 6, 2, 2, 5, 3, 1, 5, 2, 3, 4, 2, 2, 5, 1, 2, 4, 4, 1, 4, 3, 2, 3, 3, 1, 5, 2, 1, 4, 3
OFFSET
0,5
COMMENTS
a(2^k) = k, a(A029744(n)-3) = 0.
CROSSREFS
Sequence in context: A067586 A078879 A082859 * A231353 A135830 A339846
KEYWORD
nonn,easy
AUTHOR
Ralf Stephan, Jun 10 2003
STATUS
approved