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!)
A363664 a(n) = Sum_{d|n} (n/d)^(n-n/d) * binomial(d+n-1,n). 2

%I #15 Jul 12 2023 01:02:10

%S 1,4,11,56,127,1100,1717,19300,64406,383010,352717,23214660,5200301,

%T 191172406,3465549077,20859527460,1166803111,1010698826825,

%U 17672631901,102589250081802,286539905316908,75260204476154,4116715363801,548610025890719156

%N a(n) = Sum_{d|n} (n/d)^(n-n/d) * binomial(d+n-1,n).

%F a(n) = [x^n] Sum_{k>0} x^k/(1 - (k*x)^k)^(n+1).

%t a[n_] := DivisorSum[n, (n/#)^(n-n/#) * Binomial[# + n - 1, n] &]; Array[a, 25] (* _Amiram Eldar_, Jul 12 2023 *)

%o (PARI) a(n) = sumdiv(n, d, (n/d)^(n-n/d)*binomial(d+n-1, n));

%Y Cf. A342628, A359112, A363650.

%Y Cf. A343548, A363662, A363663, A363667.

%K nonn

%O 1,2

%A _Seiichi Manyama_, Jun 14 2023

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 August 14 15:36 EDT 2024. Contains 375165 sequences. (Running on oeis4.)