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 A104234 #11 May 08 2020 06:08:47 %S A104234 0,1,1,1,0,2,1,1,0,1,1,1,1,2,1,1,0,1,1,1,0,2,1,1,0,1,1,2,1,2,1,1,0,1, %T A104234 1,1,0,2,1,1,0,1,1,1,1,2,1,1,0,1,1,1,0,2,1,1,0,1,2,2,1,2,1,1,0,1,1,1, %U A104234 0,2,1,1,0,1,1,1,1,2,1,1,0,1,1,1,0,2,1,1,0,1,1,2,1,2,1,1,0,1,1,1,0,2,1,1,0,1 %N A104234 Number of k >= 1 such that k+n == 0 mod 2^k. %C A104234 Number of terms in the summation in the formula for A102370(n). %C A104234 Also, a(n) is the number of 1's in (A103185(n) written in base 2). %H A104234 David Applegate, Benoit Cloitre, Philippe Deléham and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers [<a href="http://neilsloane.com/doc/slopey.pdf">pdf</a>, <a href="http://neilsloane.com/doc/slopey.ps">ps</a>]. %H A104234 David Applegate, Benoit Cloitre, Philippe Deléham and N. J. A. Sloane, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL8/Sloane/sloane300.html">Sloping binary numbers: a new sequence related to the binary numbers</a>, J. Integer Seq. 8 (2005), no. 3, Article 05.3.6, 15 pp. %F A104234 a(2^k + y) = a(y) + 1 if y = 2^k - k - 1, = a(y) otherwise (where 0 <= y <= 2^k - 1). %p A104234 f:=proc(n) local t1,l; t1:=0; for l from 1 to n do if n+l mod 2^l = 0 then t1:=t1+1; fi; od: t1; end; %Y A104234 Cf. A102370, A103185, A105035 (records). %K A104234 nonn %O A104234 0,6 %A A104234 _N. J. A. Sloane_, Apr 02 2005