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!)
A356127 a(n) = Sum_{k=1..n} k^k * binomial(floor(n/k)+1,2). 0
1, 7, 37, 305, 3435, 50163, 873713, 17651465, 405072044, 10405078324, 295716748946, 9211817291426, 312086923883692, 11424093751088836, 449317984131957736, 18896062057875064856, 846136323944211829050, 40192544399241524385636 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = Sum_{k=1..n} k * Sum_{d|k} d^(d-1).
G.f.: (1/(1-x)) * Sum_{k>=1} (k * x)^k/(1 - x^k)^2.
MATHEMATICA
a[n_] := Sum[k^k * Binomial[Floor[n/k] + 1, 2], {k, 1, n}]; Array[a, 18] (* Amiram Eldar, Jul 28 2022*)
PROG
(PARI) a(n) = sum(k=1, n, k^k*binomial(n\k+1, 2));
(PARI) a(n) = sum(k=1, n, k*sumdiv(k, d, d^(d-1)));
(PARI) my(N=20, x='x+O('x^N)); Vec(sum(k=1, N, (k*x)^k/(1-x^k)^2)/(1-x))
CROSSREFS
Sequence in context: A199192 A089677 A075996 * A343568 A173766 A093168
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Jul 27 2022
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 September 3 05:18 EDT 2024. Contains 375649 sequences. (Running on oeis4.)