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!)
A099738 a(n) = 2*Sum_{k=1..n} (n+1-k) (Sum_{j|k} 1/floor(n/j)). 0

%I #8 Jul 29 2015 00:52:54

%S 2,5,10,15,24,30,43,52,66,78,99,107,132,150,171,188,221,236,273,291,

%T 322,352,397,409,453,489,530,558,615,633,694,727,778,826,883,900,973,

%U 1027,1088,1118,1199,1229,1314,1362,1419,1485,1578,1598,1688,1745,1826,1884

%N a(n) = 2*Sum_{k=1..n} (n+1-k) (Sum_{j|k} 1/floor(n/j)).

%C Sequence consists entirely of integers.

%C First differences give A033885.

%t f[n_] := 2Sum[(n + 1 - k)*Plus @@ (1/Floor[n/Divisors[k]]), {k, n}]; Table[ f[n], {n, 52}] (* _Robert G. Wilson v_, Nov 12 2004 *)

%K nonn

%O 1,1

%A _Leroy Quet_, Nov 09 2004

%E More terms from _Robert G. Wilson v_, Nov 12 2004

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 17 23:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)