This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A268679 #9 Feb 13 2016 23:16:51 %S A268679 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 A268679 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 A268679 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 A268679 a(n) = A268389(A001969(1+n)); A268389 without its zero terms. %H A268679 Antti Karttunen, <a href="/A268679/b268679.txt">Table of n, a(n) for n = 1..32768</a> %F A268679 a(n) = A268389(A001969(1+n)). %t A268679 f[n_] := Which[n == 1, 0, OddQ@ #, 0, EvenQ@ #, 1 + f[#/2]] &@ Fold[BitXor, n, Quotient[n, 2^Range[BitLength@ n - 1]]]; %t A268679 Array[f, {240}] /. 0 -> Nothing (* _Michael De Vlieger_, Feb 12 2016, after _Jan Mangaldan_ at A006068 *) %o A268679 (Scheme) (define (A268679 n) (A268389 (A001969 (+ 1 n)))) %Y A268679 Cf. A001969, A268389. %Y A268679 Cf. A268678 (partial sums), A268680. %K A268679 nonn,base %O A268679 1,2 %A A268679 _Antti Karttunen_, Feb 10 2016