|
Search: id:A003011
|
|
|
| A003011 |
|
Number of permutations of up to n kinds of objects, where each kind of object can occur at most two times.
(Formerly M3071)
|
|
+0
6
|
|
| 1, 3, 19, 271, 7365, 326011, 21295783, 1924223799, 229714292041, 35007742568755, 6630796801779771, 1527863209528564063, 420814980652048751629, 136526522051229388285611
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
E.g.f. A(x)=y satisfies 0=(2x^3+2x^2)y''+(-3x^3+4x-1)y'+(x^3-x^2-2x+3)y. - Michael Somos Mar 15 2004
Number of ways to use the elements of {1,..,k}, 0<=k<=2n, once each to form a sequence of n (possibly empty) sets, each having at most 2 elements. - Bob Proctor, Apr 18 2005
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 17.
|
|
LINKS
|
Index entries for related partition-counting sequences
|
|
FORMULA
|
a(n)n=a(n-1)(2n^3-n^2+n+1)+a(n-2)(-3n^3+4n^2+2n-3)+a(n-3)(n^3-2n^2-n+2).
|
|
PROGRAM
|
(PARI) a(n)=local(A); if(n<0, 0, A=(1+x+x^2/2)^n; sum(k=0, 2*n, k!*polcoeff(A, k)))
|
|
CROSSREFS
|
a(n) = Sum[C(n, k)*A105749(k), 0<=k<=n]
Replace "sequence" by "collection" in comment: A105748.
Replace "sets" by "lists" in comment: A082765.
Sequence in context: A118023 A054590 A069344 this_sequence A143597 A115705 A136171
Adjacent sequences: A003008 A003009 A003010 this_sequence A003012 A003013 A003014
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 18 2002
|
|
|
Search completed in 0.002 seconds
|
