login
The OEIS is supported by the many generous donors to the OEIS 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

%I #10 Sep 08 2022 08:44:58

%S 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,

%T 10,15,18,21,2,19,22,27,8,27,10,30,20,17,22,44,6,28,21,29,22,47,21,34,

%U 17,28,35,63,8,37,44,38,28,43,19,51,41,55,29

%N a(n) = Sum_{k=1..n} (n mod floor(n/k)) = T(n,n), array T as in A049783.

%H G. C. Greubel, <a href="/A049785/b049785.txt">Table of n, a(n) for n = 1..1000</a>

%p seq( add(`mod`(n, floor(n/j)), j=1..n), n=1..70); # _G. C. Greubel_, Dec 12 2019

%t Table[Sum[Mod[n, Floor[n/j]], {j,n}], {n,70}] (* _G. C. Greubel_, Dec 12 2019 *)

%o (PARI) vector(70, n, sum(j=1,n, lift(Mod(n, n\j))) ) \\ _G. C. Greubel_, Dec 12 2019

%o (Magma) [ &+[(n mod Floor(n/j)): j in [1..n]]: n in [1..70]]; // _G. C. Greubel_, Dec 12 2019

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

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

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

%K nonn

%O 1,7

%A _Clark Kimberling_

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 06:34 EDT 2024. Contains 371920 sequences. (Running on oeis4.)