A268679 a(n) = A268389(A001969(1+n)); A268389 without its zero terms.

1, 2, 1, 1, 2, 1, 3, 4, 1, 2, 1, 1, 2, 1, 3, 1, 4, 1, 2, 2, 1, 3, 1, 1, 5, 1, 2, 2, 1, 3, 1, 2, 1, 4, 1, 1, 3, 1, 2, 2, 1, 6, 1, 1, 3, 1, 2, 1, 2, 1, 5, 3, 1, 2, 1, 1, 2, 1, 4, 3, 1, 2, 1, 1, 2, 1, 3, 4, 1, 2, 1, 1, 2, 1, 3, 5, 1, 2, 1, 2, 1, 3, 1, 1, 6, 1, 2, 2, 1, 3, 1, 1, 4, 1, 2, 1, 3, 1, 2, 2, 1, 5, 1, 1, 3, 1, 2, 2, 1, 4, 1, 3, 1, 2, 1, 1, 2, 1, 4, 3

Offset: 1

Author

Antti Karttunen, Feb 10 2016

Keywords

• nonn
• base

Links

• Antti Karttunen, Table of n, a(n) for n = 1..32768

Crossrefs

Cf. A001969, A268389.

Cf. A268678 (partial sums), A268680.

Programs

Mathematica

f[n_] := Which[n == 1, 0, OddQ@ #, 0, EvenQ@ #, 1 + f[#/2]] &@ Fold[BitXor, n, Quotient[n, 2^Range[BitLength@ n - 1]]];
Array[f, {240}] /. 0 -> Nothing (* Michael De Vlieger, Feb 12 2016, after Jan Mangaldan at A006068 *)

Scheme

(define (A268679 n) (A268389 (A001969 (+ 1 n))))

Formula

a(n) = A268389(A001969(1+n)).