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!)
A340103 a(n) = [x^n] Product_{k>=1} (1 + n^(k-1)*x^k). 10
1, 1, 2, 12, 80, 875, 10584, 170471, 2949120, 63772920, 1441000000, 38818444632, 1089573617664, 35185728919614, 1175820172477440, 44425722744140625, 1722925924631969792, 74364737115532234518, 3291298649632850485248, 159785357022861166517580, 7932051456000000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = Sum_{k=0..A003056(n)} q(n,k) * n^(n-k), where q(n,k) is the number of partitions of n into k distinct parts.
a(n) ~ c * n^(n-1), where c = BesselI(1,2) = A096789 = 1.590636854637329... - Vaclav Kotesovec, May 09 2021
MATHEMATICA
Table[SeriesCoefficient[Product[(1 + n^(k - 1) x^k), {k, 1, n}], {x, 0, n}], {n, 0, 20}]
Unprotect[Power]; 0^0 = 1; Table[Sum[Length[Select[IntegerPartitions[n, {k}], UnsameQ @@ # &]] n^(n - k), {k, 0, Floor[(Sqrt[8 n + 1] - 1)/2]}], {n, 0, 20}]
Join[{1}, Table[SeriesCoefficient[n*QPochhammer[-1/n, n*x]/(n+1), {x, 0, n}], {n, 1, 20}]] (* Vaclav Kotesovec, May 09 2021 *)
CROSSREFS
Sequence in context: A246018 A292933 A058872 * A055548 A092850 A199420
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, 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 February 22 06:21 EST 2024. Contains 370240 sequences. (Running on oeis4.)