cp's OEIS Frontend

A059062 Card-matching numbers (Dinner-Diner matching numbers).

%I A059062 #24 Sep 26 2017 05:08:51
%S A059062 1,0,0,0,0,0,1,1,0,25,0,100,0,100,0,25,0,1,2252,15150,48600,99350,
%T A059062 144150,156753,131000,87075,45000,19300,6000,1800,250,75,0,1,44127009,
%U A059062 274314600,822998550,1583402400,2189652825,2311947008
%N A059062 Card-matching numbers (Dinner-Diner matching numbers).
%C A059062 This is a triangle of card matching numbers. A deck has n kinds of cards, 5 of each kind. The deck is shuffled and dealt in to n hands with 5 cards each. A match occurs for every card in the j-th hand of kind j. Triangle T(n,k) is the number of ways of achieving exactly k matches (k=0..5n). The probability of exactly k matches is T(n,k)/((5n)!/(5!)^n).
%C A059062 Rows have lengths 1,6,11,16,...
%C A059062 Analogous to A008290 - _Zerinvary Lajos_, Jun 22 2005
%D A059062 F. N. David and D. E. Barton, Combinatorial Chance, Hafner, NY, 1962, Ch. 7 and Ch. 12.
%D A059062 J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, pp. 174-178.
%D A059062 R. P. Stanley, Enumerative Combinatorics Volume I, Cambridge University Press, 1997, p. 71.
%H A059062 Vincenzo Librandi, <a href="/A059062/b059062.txt"> Rows n = 1..15 of triangle, flattened</a>
%H A059062 F. F. Knudsen and I. Skau, <a href="http://www.jstor.org/stable/2691467">On the Asymptotic Solution of a Card-Matching Problem</a>, Mathematics Magazine 69 (1996), 190-197.
%H A059062 Barbara H. Margolius, <a href="http://academic.csuohio.edu/bmargolius/homepage/dinner/dinner/cardentry.htm">Dinner-Diner Matching Probabilities</a>
%H A059062 B. H. Margolius, <a href="http://www.jstor.org/stable/3219303">The Dinner-Diner Matching Problem</a>, Mathematics Magazine, 76 (2003), 107-118.
%H A059062 S. G. Penrice, <a href="http://www.jstor.org/stable/2324927">Derangements, permanents and Christmas presents</a>, The American Mathematical Monthly 98(1991), 617-620.
%H A059062 <a href="/index/Ca#cardmatch">Index entries for sequences related to card matching</a>
%F A059062 G.f.: sum(coeff(R(x, n, k), x, j)*(t-1)^j*(n*k-j)!, j=0..n*k) where n is the number of kinds of cards, k is the number of cards of each kind (here k is 5) and R(x, n, k) is the rook polynomial given by R(x, n, k)=(k!^2*sum(x^j/((k-j)!^2*j!))^n (see Stanley or Riordan). coeff(R(x, n, k), x, j) indicates the j-th coefficient on x of the rook polynomial.
%e A059062 There are 25 ways of matching exactly 2 cards when there are 2 different kinds of cards, 5 of each so T(2,2)=25.
%p A059062 p := (x,k)->k!^2*sum(x^j/((k-j)!^2*j!),j=0..k); R := (x,n,k)->p(x,k)^n; f := (t,n,k)->sum(coeff(R(x,n,k),x,j)*(t-1)^j*(n*k-j)!,j=0..n*k);
%p A059062 for n from 0 to 4 do seq(coeff(f(t,n,5),t,m)/5!^n,m=0..5*n); od;
%t A059062 nmax = 4; r[x_, n_, k_] := (k!^2*Sum[ x^j/((k-j)!^2*j!), {j, 0, k}])^n; f[t_, n_, k_] := Sum[ Coefficient[ r[x, n, k], x, j]*(t-1)^j*(n*k-j)!, {j, 0, n*k}]; Flatten[ Table[ Coefficient[ f[t, n, 5], t, m]/5!^n, {n, 0, nmax}, {m, 0, 5n}]](* _Jean-François Alcover_, Nov 23 2011, after Maple *)
%Y A059062 Cf. A008290, A059056-A059071.
%Y A059062 Cf. A008290.
%K A059062 nonn,tabf,nice
%O A059062 0,10
%A A059062 Barbara Haas Margolius (margolius(AT)math.csuohio.edu)