Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A148092
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A148092 The partition function G(n,6). +0
2
1, 1, 2, 5, 15, 52, 203, 876, 4131, 21065, 115274, 672673, 4163743, 27216840, 187160429, 1349511178, 10173555345, 79982663997, 654277037674, 5557624876513, 48931106059451, 445790174654588, 4196351007814659, 40757862664061104, 407944375184911787 (list; graph; listen)
OFFSET

0,3

REFERENCES

F. L. Miksa, L. Moser and M. Wyman, Restricted partitions of finite sets, Canad. Math. Bull., 1 (1958), 87-96.

LINKS

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

P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.

FORMULA

E.g.f.: exp( x + x^2/2 + x^3/6 + x^4/24 + x^5/120 + x^6/720 ).

CROSSREFS

The sequences G(n,1), G(n,2), G(n,3), G(n,4), G(n,5), G(n,6) are given by A000012, A000085, A001680, A001681, A110038, A148092 respectively.

Sequence in context: A110038 A056273 A141080 this_sequence A099262 A141081 A108305

Adjacent sequences: A148089 A148090 A148091 this_sequence A148093 A148094 A148095

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