login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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

%I #9 Feb 13 2016 23:16:51

%S 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,

%T 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,

%U 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

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

%H Antti Karttunen, <a href="/A268679/b268679.txt">Table of n, a(n) for n = 1..32768</a>

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

%t f[n_] := Which[n == 1, 0, OddQ@ #, 0, EvenQ@ #, 1 + f[#/2]] &@ Fold[BitXor, n, Quotient[n, 2^Range[BitLength@ n - 1]]];

%t Array[f, {240}] /. 0 -> Nothing (* _Michael De Vlieger_, Feb 12 2016, after _Jan Mangaldan_ at A006068 *)

%o (Scheme) (define (A268679 n) (A268389 (A001969 (+ 1 n))))

%Y Cf. A001969, A268389.

%Y Cf. A268678 (partial sums), A268680.

%K nonn,base

%O 1,2

%A _Antti Karttunen_, Feb 10 2016