|
Search: id:A000279
|
|
|
| A000279 |
|
Card matching.
(Formerly M3106 N1258)
|
|
+0
3
|
|
| 3, 24, 216, 1824, 15150, 124416, 1014888, 8241792, 66724398, 538990800, 4346692680, 35009591040, 281699380560, 2264868936960, 18198009147600, 146142982814208, 1173123636533454, 9413509300965936, 75513633110271264
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Number of permutations of 3 distinct letters (ABC) each with n copies such that one (1) fixed points. E.g. if AAAAABBBBBCCCCC n=3*5 letters permutations then one fixed points n5=15150 - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Feb 02 2006
|
|
REFERENCES
|
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 193.
|
|
LINKS
|
Index entries for sequences related to card matching
|
|
FORMULA
|
a(n)=3n*sum(binomial(n, k+1)*binomial(n, k)*binomial(n-1, k), k=0..n-1).
|
|
CROSSREFS
|
Cf. A000489, A000535.
Cf. A033581.
Sequence in context: A074580 A063979 A073978 this_sequence A001099 A080523 A081133
Adjacent sequences: A000276 A000277 A000278 this_sequence A000280 A000281 A000282
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 26 2000
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 19 2004
|
|
|
Search completed in 0.002 seconds
|
