|
Search: id:A076732
|
|
|
| A076732 |
|
Table T(n,k) giving number of ways of obtaining exactly one correct answer on an (n, k)-matching problem (1<=k<=n). |
|
+0
2
|
|
| 1, 1, 0, 1, 2, 3, 1, 4, 9, 8, 1, 6, 21, 44, 45, 1, 8, 39, 128, 265, 264, 1, 10, 63, 284, 905, 1854, 1855, 1, 12, 93, 536, 2325, 7284, 14833, 14832, 1, 14, 129, 908, 5005, 21234, 65821, 133496, 133497, 1, 16, 171, 1424, 9545, 51264, 214459, 660064, 1334961
(list; table; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
REFERENCES
|
D. Hanson, K. Seyffarth, J. H. Weston, "Matchings, Derangements, Rencontres," Mathematics Magazine, Vol. 56, No. 4, September 1983.
|
|
FORMULA
|
F(n, k)*Sum{((-1)^j)*C(k-1, j)*(n-1-j)!}(j=0 to k-1), where F(n, k)=k/(n-k)!, for 1<=k<=n.
|
|
EXAMPLE
|
1; 1,0; 1,2,3; 1,4,9,8; ...
|
|
CROSSREFS
|
Sequence in context: A057597 A121340 A119865 this_sequence A130152 A084608 A078990
Adjacent sequences: A076729 A076730 A076731 this_sequence A076733 A076734 A076735
|
|
KEYWORD
|
nonn,tabl,uned
|
|
AUTHOR
|
Mohammad K. Azarian (azarian(AT)evansville.edu), Oct 28 2002
|
|
|
Search completed in 0.002 seconds
|
