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”).

A095767
a(n) = valuation(A004001(n),2).
1
0, 0, 1, 1, 0, 2, 2, 2, 0, 1, 0, 0, 3, 3, 3, 3, 0, 1, 0, 2, 2, 0, 1, 1, 0, 0, 0, 4, 4, 4, 4, 4, 0, 1, 0, 2, 0, 0, 1, 0, 3, 3, 0, 1, 1, 0, 0, 0, 2, 0, 0, 1, 1, 1, 0, 0, 0, 0, 5, 5, 5, 5, 5, 5, 0, 1, 0, 2, 0, 1, 1, 0, 3, 0, 1, 1, 0, 2, 0, 0, 1, 0, 0, 4, 4, 4, 0, 1, 0, 0, 2, 0, 0, 1, 1, 1, 0, 3, 3, 0, 0, 0, 1, 1, 1
OFFSET
1,6
FORMULA
Partial formula: a(2^(n+1) - n + i) = n for 0<=i<=n.
MATHEMATICA
a[1] = a[2] = 1; a[n_] := a[n] = a[a[n - 1]] + a[n - a[n - 1]]; f[n_] := Length[ NestWhileList[ #/2 &, n, IntegerQ[ # ] &]] - 2; Table[ f[ a[n]], {n, 105}] (* Robert G. Wilson v, Jun 11 2004 *)
CROSSREFS
Cf. A095768.
Sequence in context: A110857 A108867 A218604 * A241922 A071446 A071469
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jun 05 2004
STATUS
approved