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

%I #19 Oct 24 2023 00:51:53

%S 1,5,12,23,36,54,74,97,125,156,186,226,268,306,354,409,458,515,574,

%T 636,710,778,838,922,1013,1086,1168,1264,1350,1452,1556,1651,1762,

%U 1864,1966,2105,2234,2332,2448,2594,2726,2864,3004,3132,3294,3444,3564,3736,3917,4067

%N a(n) = Sum_{k=1..n} floor(n/k) * ceiling(n/k).

%F G.f.: ((1 + x) / (1 - x)) * Sum_{k>=1} x^k / (1 - x^k)^2.

%F a(n) = 1 + Sum_{k=1..n-1} (sigma(k) + sigma(k+1)) for n > 0.

%F a(n) ~ (Pi*n)^2/6. - _Vaclav Kotesovec_, Jun 24 2021

%t Table[Sum[Ceiling[n/k] Floor[n/k], {k, 1, n}], {n, 1, 50}]

%t Table[1 + Sum[DivisorSigma[1, k] + DivisorSigma[1, k + 1], {k, 1, n - 1}], {n, 1, 50}]

%t nmax = 50; CoefficientList[Series[((1 + x)/(1 - x)) Sum[x^k/(1 - x^k)^2, {k, 1, nmax}], {x, 0, nmax}], x] // Rest

%o (Magma) [&+[Floor(n/k)*Ceiling(n/k):k in [1..n]]:n in [1..50]]; // _Marius A. Burtea_, Feb 16 2020

%o (PARI) a(n) = sum(k=1, n, my(q=n/k); floor(q) * ceil(q)); \\ _Michel Marcus_, Feb 17 2020

%o (Python)

%o from math import isqrt

%o from sympy import divisor_sigma

%o def A332569(n): return -(s:=isqrt(n))**2*(s+1)+sum((q:=n//k)*((k<<1)+q+1) for k in range(1,s+1))-divisor_sigma(n) # _Chai Wah Wu_, Oct 23 2023

%Y Row sums of A085383.

%Y Cf. A000203, A006218, A006590, A024916, A049697, A222548, A332490.

%K nonn

%O 1,2

%A _Ilya Gutkovskiy_, Feb 16 2020

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 25 05:56 EDT 2024. Contains 371964 sequences. (Running on oeis4.)