The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A339481 a(n) = Sum_{d|n} d^(n-d) * binomial(d+n/d-2, d-1). 8
1, 2, 2, 10, 2, 131, 2, 1282, 4376, 16907, 2, 1138272, 2, 5793475, 154455992, 469893122, 2, 49501130330, 2, 1318441711177, 19001093813466, 3138439911059, 2, 15989399214596398, 6675720214843752, 3937376603803099, 6754271297694102092, 47097064577536888014, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
G.f.: Sum_{k >= 1} (x/(1 - (k * x)^k))^k.
If p is prime, a(p) = 2.
MATHEMATICA
a[n_] := DivisorSum[n, #^(n - #) * Binomial[# + n/# - 2, # - 1] &]; Array[a, 30] (* Amiram Eldar, Apr 25 2021 *)
PROG
(PARI) a(n) = sumdiv(n, d, d^(n-d)*binomial(d+n/d-2, d-1));
(PARI) my(N=40, x='x+O('x^N)); Vec(sum(k=1, N, (x/(1-(k*x)^k))^k))
CROSSREFS
Sequence in context: A321415 A319692 A308693 * A163937 A083457 A163808
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Apr 24 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 May 21 01:24 EDT 2024. Contains 372720 sequences. (Running on oeis4.)