login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049785 a(n) = Sum_{k=1..n} (n mod floor(n/k)) = T(n,n), array T as in A049783. 7
0, 0, 0, 0, 1, 0, 2, 0, 2, 1, 5, 0, 5, 4, 3, 2, 9, 2, 10, 4, 6, 7, 17, 0, 10, 11, 13, 6, 19, 4, 18, 10, 15, 18, 21, 2, 19, 22, 27, 8, 27, 10, 30, 20, 17, 22, 44, 6, 28, 21, 29, 22, 47, 21, 34, 17, 28, 35, 63, 8, 37, 44, 38, 28, 43, 19, 51, 41, 55, 29 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,7

LINKS

G. C. Greubel, Table of n, a(n) for n = 1..1000

MAPLE

seq( add(`mod`(n, floor(n/j)), j=1..n), n=1..70); # G. C. Greubel, Dec 12 2019

MATHEMATICA

Table[Sum[Mod[n, Floor[n/j]], {j, n}], {n, 70}] (* G. C. Greubel, Dec 12 2019 *)

PROG

(PARI) vector(70, n, sum(j=1, n, lift(Mod(n, n\j))) ) \\ G. C. Greubel, Dec 12 2019

(MAGMA) [ &+[(n mod Floor(n/j)): j in [1..n]]: n in [1..70]]; // G. C. Greubel, Dec 12 2019

(Sage) [sum( n%floor(n/j) for j in (1..n)) for n in (1..70)] # G. C. Greubel, Dec 12 2019

(GAP) List([1..70], n-> Sum([1..n], j-> n mod Int(n/j)) ); # G. C. Greubel, Dec 12 2019

CROSSREFS

Cf. A049783, A049784, A049786, A049787, A049788, A049789.

Sequence in context: A058707 A242691 A081082 * A036997 A116900 A254372

Adjacent sequences:  A049782 A049783 A049784 * A049786 A049787 A049788

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 7 00:04 EDT 2021. Contains 343609 sequences. (Running on oeis4.)