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!)
A345176 a(n) = Sum_{k=1..n} floor(n/k)^k. 3
1, 3, 5, 10, 12, 26, 28, 52, 73, 115, 117, 295, 297, 439, 713, 1160, 1162, 2448, 2450, 4644, 6832, 8902, 8904, 23536, 25639, 33857, 53247, 84961, 84963, 192237, 192239, 318477, 493909, 625015, 695789, 1761668, 1761670, 2285996, 3872598, 6255230, 6255232, 13392362 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
G.f.: (1/(1 - x)) * Sum_{j>=1} Sum_{k>=1} (k*x^k)^j * (1 - x^j).
a(n) ~ 3^((n - mod(n,3))/3 + 1)/2. - Vaclav Kotesovec, Jun 11 2021
MATHEMATICA
a[n_] := Sum[Floor[n/k]^k, {k, 1, n}]; Array[a, 40] (* Amiram Eldar, Jun 10 2021 *)
PROG
(PARI) a(n) = sum(k=1, n, (n\k)^k);
(PARI) my(N=66, x='x+O('x^N)); Vec(sum(j=1, N, (1-x^j)*sum(k=1, N, (k*x^k)^j))/(1-x))
CROSSREFS
Sequence in context: A266663 A007557 A034746 * A275219 A080931 A299533
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Jun 10 2021
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 04:14 EDT 2024. Contains 371918 sequences. (Running on oeis4.)