Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059068
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A059068 Card-matching numbers (Dinner-Diner matching numbers). +0
1
1, 9, 8, 6, 0, 1, 297, 672, 736, 480, 246, 64, 24, 0, 1, 13833, 49464, 84510, 90944, 69039, 38448, 16476, 5184, 1431, 216, 54, 0, 1, 748521, 3662976, 8607744, 12880512, 13731616, 11042688, 6928704, 3458432, 1395126 (list; graph; listen)
OFFSET

0,2

COMMENT

This is a triangle of card matching numbers. A deck has 4 kinds of cards, n of each kind. The deck is shuffled and dealt in to 4 hands with each with n cards. 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..4n). The probability of exactly k matches is T(n,k)/((4n)!/n!^4).

Rows have lengths 1,5,9,13,...

Analogous to A008290 - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 22 2005

REFERENCES

F. N. David and D. E. Barton, Combinatorial Chance, Hafner, NY, 1962, Ch. 7 and Ch. 12.

F. F. Knudsen and I. Skau, On the Asymptotic Solution of a Card-Matching Problem, Mathematics Magazine 69 (1996), 190-197.

B. H. Margolius, The Dinner-Diner Matching Problem, Mathematics Magazine, 76 (2003), 107-118.

S. G. Penrice, Derangements, permanents and Christmas presents, The American Mathematical Monthly 98(1991), 617-620.

J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 174-178.

R. P. Stanley, Enumerative Combinatorics Volume I, Cambridge University Press, 1997, p. 71.

LINKS

Barbara H. Margolius, Dinner-Diner Matching Probabilities

Index entries for sequences related to card matching

FORMULA

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 (4 in this case), k is the number of cards of each kind 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 coefficient for x^j of the rook polynomial.

EXAMPLE

There are 736 ways of matching exactly 2 cards when there are 2 cards of each kind and 4 kinds of card so T(2,2)=736.

MAPLE

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);

for n from 0 to 5 do seq(coeff(f(t, 4, n), t, m)/n!^4, m=0..4*n); od;

CROSSREFS

Cf. A008290, A059056-A059071.

Cf. A008290.

Sequence in context: A011458 A119384 A094141 this_sequence A059069 A084660 A002391

Adjacent sequences: A059065 A059066 A059067 this_sequence A059069 A059070 A059071

KEYWORD

nonn,tabf,nice

AUTHOR

Barbara Haas Margolius (margolius(AT)math.csuohio.edu)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research