login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A103813
Partial sums of A102370.
1
0, 3, 9, 14, 18, 33, 43, 52, 60, 71, 85, 98, 126, 149, 167, 184, 200, 219, 241, 262, 282, 313, 339, 364, 388, 415, 445, 506, 550, 589, 623, 656, 688, 723, 761, 798, 834, 881, 923, 964, 1004, 1047, 1093, 1138, 1198, 1253, 1303, 1352, 1400, 1451, 1505, 1558, 1610, 1673
OFFSET
0,2
REFERENCES
Hardy and Wright, Sect. 18.2, for definition of average order.
LINKS
David Applegate, Benoit Cloitre, Philippe Deléham, and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers [pdf, ps].
David Applegate, Benoit Cloitre, Philippe Deléham, and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers, J. Integer Seq. 8 (2005), no. 3, Article 05.3.6, 15 pp.
FORMULA
The average order of A102370(n) is n + O(log n).
MATHEMATICA
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 *)
CROSSREFS
Cf. A102370.
Sequence in context: A092476 A291641 A071346 * A001968 A305373 A111907
KEYWORD
nonn,base
AUTHOR
STATUS
approved