A024930 a(n) = sum of remainders of n mod 1,3,5,...,2k-1, where k = [ (n+1)/2 ].

0, 0, 0, 1, 2, 1, 3, 6, 6, 5, 9, 11, 16, 15, 13, 20, 27, 23, 31, 35, 34, 33, 43, 51, 57, 56, 56, 62, 75, 66, 80, 95, 96, 95, 99, 104, 121, 120, 122, 136, 155, 144, 164, 174, 163, 162, 184, 204, 220, 214, 218, 230, 255, 242, 252, 272, 277, 276, 304, 310, 339, 338, 328, 359, 372, 357

Offset: 1

Author

Clark Kimberling

Keywords

• nonn

Links

• Robert Israel, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A078471, A093005.

Programs

Maple

A093005:= [seq(n*ceil(n/2),n=1..100)]:
A078471:= ListTools:-PartialSums([seq(numtheory:-sigma(n/2^padic:-ordp(n,2)),n=1..100)]):
A093005-A078471; # Robert Israel, May 13 2019

Formula

a(n) = A093005(n) - A078471(n). - Robert Israel, May 13 2019