This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A024930 a(n) = sum of remainders of n mod 1,3,5,...,2k-1, where k = [ (n+1)/2 ]. 1
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS Robert Israel, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A093005(n) - A078471(n). - Robert Israel, May 13 2019 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 CROSSREFS Cf. A078471, A093005. Sequence in context: A205840 A171084 A118287 * A121966 A021472 A258047 Adjacent sequences:  A024927 A024928 A024929 * A024931 A024932 A024933 KEYWORD nonn AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 19 21:01 EDT 2019. Contains 328225 sequences. (Running on oeis4.)