|
Search: id:A001680
|
|
|
| A001680 |
|
The partition function G(n,3).
(Formerly M1465 N0579)
|
|
+0
8
|
|
| 1, 1, 2, 5, 14, 46, 166, 652, 2780, 12644, 61136, 312676, 1680592, 9467680, 55704104, 341185496, 2170853456, 14314313872, 97620050080, 687418278544, 4989946902176, 37286121988256, 286432845428192, 2259405263572480, 18280749571449664, 151561941235370176
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Number of '12-3 and 21-3'-avoiding permutations.
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
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.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 18
T. Mansour, Restricted permutations by patterns of type 2-1.
|
|
FORMULA
|
E.g.f.: exp ( x + x^2 / 2 + x^3 / 6 ).
|
|
CROSSREFS
|
Cf. A001681.
Sequence in context: A149897 A124527 A149898 this_sequence A107268 A006216 A148337
Adjacent sequences: A001677 A001678 A001679 this_sequence A001681 A001682 A001683
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com). More terms added May 13 2009.
|
|
|
Search completed in 0.002 seconds
|
