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 A103813 #23 Jan 22 2024 10:25:03
%S A103813 0,3,9,14,18,33,43,52,60,71,85,98,126,149,167,184,200,219,241,262,282,
%T A103813 313,339,364,388,415,445,506,550,589,623,656,688,723,761,798,834,881,
%U A103813 923,964,1004,1047,1093,1138,1198,1253,1303,1352,1400,1451,1505,1558,1610,1673
%N A103813 Partial sums of A102370.
%D A103813 Hardy and Wright, Sect. 18.2, for definition of average order.
%H A103813 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 A103813 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 A103813 The average order of A102370(n) is n + O(log n).
%t A103813 Accumulate[f[n_] := Block[{k = 1, s = 0, l = Max[2, Floor[Log[2, n + 1] + 2]]}, While[k < l, If[ Mod[n + k, 2^k] == 0, s = s + 2^k]; k++ ]; s]; Table[ f[n] + n, {n, 0, 53}] ] (* _James C. McMahon_, Jan 21 2024 *)
%Y A103813 Cf. A102370.
%K A103813 nonn,base
%O A103813 0,2
%A A103813 _N. J. A. Sloane_ and _David Applegate_, Apr 01 2005