A258669 Number of partitions of 2*n! into parts that are at most n.

0, 1, 3, 19, 1033, 1302311, 74312057469, 291484874476601933, 109290159404495354765494065, 5262212497884462986538879797523944401, 42425405450182072688801993326226988336684453926401, 72600595215718916449806606426629386781199080157371905867835756161

Offset

0,3

Links

Vaclav Kotesovec, Table of n, a(n) for n = 0..31

A. V. Sills and D. Zeilberger, Formulae for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz) (arXiv:1108.4391 [math.CO])

Formula

a(n) ~ n * 2^(n-1) * (n!)^(n-3).

Crossrefs

Cf. A236810, A237998, A238000, A258668, A258670, A258671.

Sequence in context: A350121 A014015 A114301 * A192340 A326973 A248704

Adjacent sequences: A258666 A258667 A258668 * A258670 A258671 A258672

Keyword

nonn

Author

Vaclav Kotesovec, Jun 07 2015

Status

approved