Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A149187
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A149187 a(n) = total number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2, ..., 6, for 0 <= k <= 6n. +0
2
1, 6, 1709, 9268549, 295887993624, 34155922905682979, 10893033763705794846727, 8064519699524417149584982475, 12261371699318896159811165091392898, 34949877647533654983311522321749656046802, 174047342897498341701547082125166096889157924610, 1431472607165249058159939223685478666695036430843693596 (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, A144509, A144512.

Sequence in context: A131453 A160226 A034841 this_sequence A160301 A024086 A094036

Adjacent sequences: A149184 A149185 A149186 this_sequence A149188 A149189 A149190

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), May 13 2009

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 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research