|
|
A091829
|
|
a(1)=1; a(2n)=a(n)+1, a(2n+1)=a(n) mod 2.
|
|
1
|
|
|
1, 2, 1, 3, 0, 2, 1, 4, 1, 1, 0, 3, 0, 2, 1, 5, 0, 2, 1, 2, 1, 1, 0, 4, 1, 1, 0, 3, 0, 2, 1, 6, 1, 1, 0, 3, 0, 2, 1, 3, 0, 2, 1, 2, 1, 1, 0, 5, 0, 2, 1, 2, 1, 1, 0, 4, 1, 1, 0, 3, 0, 2, 1, 7, 0, 2, 1, 2, 1, 1, 0, 4, 1, 1, 0, 3, 0, 2, 1, 4, 1, 1, 0, 3, 0, 2, 1, 3, 0, 2, 1, 2, 1, 1, 0, 6, 1, 1, 0, 3, 0, 2, 1, 3, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
f:= proc(n) option remember;
if n::even then procname(n/2)+1 else procname((n-1)/2) mod 2 fi
end proc:
f(1):= 1:
|
|
MATHEMATICA
|
a[1] = 1;
a[n_] := a[n] = If[OddQ[n], Mod[a[n-1]+1, 2], a[n/2]+1];
|
|
PROG
|
(PARI) a(n)=if(n<2, 1, if(n%2, (a(n-1)+1)%2, a(n/2)+1))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|