The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A049784 a(n) = Sum_{k=1..n} T(n,k), array T as in A049783. 7
 0, 0, 1, 1, 6, 3, 14, 12, 21, 21, 51, 21, 62, 69, 79, 63, 136, 90, 181, 129, 160, 186, 324, 160, 264, 306, 371, 297, 512, 285, 528, 444, 547, 628, 768, 372, 715, 820, 980, 652, 1079, 702, 1173, 1053, 1002, 1155, 1728, 960, 1417, 1292 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS G. C. Greubel, Table of n, a(n) for n = 1..1000 MAPLE seq( add(add(`mod`(n, floor(k/j)), j=1..k), k=1..n), n=1..60); # G. C. Greubel, Dec 12 2019 MATHEMATICA Table[Sum[Sum[Mod[n, Floor[k/j]], {j, k}], {k, n}], {n, 60}] (* G. C. Greubel, Dec 12 2019 *) PROG (PARI) a(n) = sum(k=1, n, sum(j=1, k, lift(Mod(n, k\j)) )); vector(60, n, a(n)) \\ G. C. Greubel, Dec 12 2019 (Magma) [ &+[(&+[(n mod Floor(k/j)): j in [1..k]]): k in [1..n]]: n in [1..60]]; // G. C. Greubel, Dec 12 2019 (Sage) [sum(sum( n%floor(k/j) for j in (1..k)) for k in (1..n)) for n in (1..60)] # G. C. Greubel, Dec 12 2019 (GAP) List([1..60], n-> Sum([1..n], k-> Sum([1..k], j-> n mod Int(k/j)) )); # G. C. Greubel, Dec 12 2019 CROSSREFS Row sums of A049783. Cf. A049785, A049786, A049787, A049788, A049789. Sequence in context: A214498 A128756 A345056 * A341746 A097917 A116570 Adjacent sequences: A049781 A049782 A049783 * A049785 A049786 A049787 KEYWORD nonn AUTHOR Clark Kimberling STATUS approved

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

Last modified May 21 21:53 EDT 2024. Contains 372738 sequences. (Running on oeis4.)