Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A144509
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
5
1, 5, 456, 405408, 1495388159, 15467641899285, 361207016885536095, 16557834064546698285496, 1350410785161120363519024709, 182141025850694258874753732988078, 38395944834298393218465758049745918098, 12093097322244029427838390643054170162054258, 5485321312184901565806045962453632525844948020084 (list; graph; listen)
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: A054332 A145247 A055305 this_sequence A060855 A125534 A024071

Adjacent sequences: A144506 A144507 A144508 this_sequence A144510 A144511 A144512

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research