Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A144508
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A144508 a(n) = total number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2, 3 or 4, for 0 <= k <= 4n. +0
6
1, 4, 121, 18252, 7958726, 7528988476, 13130817809439, 38001495237579931, 169490425291053577442, 1102725620990181693266071, 10030550674270068548738783696, 123317200510025161580777179001154, 1993320784474917266370637900936051186, 41401645296339316791633672053851083955147 (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, A144509.

Sequence in context: A098839 A071129 A033934 this_sequence A080179 A144993 A064681

Adjacent sequences: A144505 A144506 A144507 this_sequence A144509 A144510 A144511

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research