login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A258668 Number of partitions of (n-1)! into parts that are at most n. 6
0, 1, 1, 2, 9, 333, 436140, 43079658188, 416768277321177570, 479533252041533318548951081, 82915824358567616469138110469031459201, 2733701379858734057121091262990514105871808751388190, 21440005073020480325389224271234447054906430340227337359088146738881 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

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

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!)^(n-3) / n^(n-2).

CROSSREFS

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

Sequence in context: A308647 A015177 A005271 * A012938 A302251 A013093

Adjacent sequences:  A258665 A258666 A258667 * A258669 A258670 A258671

KEYWORD

nonn

AUTHOR

Vaclav Kotesovec, Jun 07 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 31 02:33 EDT 2021. Contains 346367 sequences. (Running on oeis4.)