login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A144509 a(n) = total number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2, ..., 5, for 0 <= k <= 5n. 4
1, 5, 456, 405408, 1495388159, 15467641899285, 361207016885536095, 16557834064546698285496, 1350410785161120363519024709, 182141025850694258874753732988078, 38395944834298393218465758049745918098, 12093097322244029427838390643054170162054258, 5485321312184901565806045962453632525844948020084 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

LINKS

David Applegate and N. J. A. Sloane, The Gift Exchange Problem (arXiv:0907.0513, 2009)

CROSSREFS

Cf. A001515, A144416, A144508.

Sequence in context: A145247 A177026 A055305 * A060855 A125534 A024071

Adjacent sequences:  A144506 A144507 A144508 * A144510 A144511 A144512

KEYWORD

nonn

AUTHOR

David Applegate and N. J. A. Sloane (njas(AT)research.att.com), Dec 15 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 09:17 EST 2012. Contains 206009 sequences.