|
%I M1668 N0656 #32 Sep 28 2017 08:15:57
%S 1,2,6,23,109,618,4096,31133,267219,2557502,27011734,312115953,
%T 3916844779,53053052462,771450742596,11986779006647,198204672604489,
%U 3475110017769282,64396888392712366,1257612452945760503,25815617698822423341,555708180579477963962,12517189538209383465496
%N Matrices with 2 rows.
%C a(n) is the number of ways in which a deck with n - 1 matched pairs and two singleton cards may be dealt into n hands of two cards, assuming the order of the hands and the order of the cards in each hand is irrelevant. (See Art of Problem Solving link for proof.) - _Joel B. Lewis_, Sep 30 2012
%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H John Cerkan, <a href="/A002136/b002136.txt">Table of n, a(n) for n = 3..450</a>
%H Art of Problem Solving, <a href="http://www.artofproblemsolving.com/Forum/viewtopic.php?f=42&t=366633">Partitioning a deck with 2 cards in n types into pairs</a>
%H P. A. MacMahon, <a href="http://plms.oxfordjournals.org/content/s2-17/1/25.extract">Combinations derived from m identical sets of n different letters and their connexion with general magic squares</a>, Proc. London Math. Soc., 17 (1917), 25-41.
%F a(n+1) = A002135(n) + n*A002135(n - 1) + n*(n - 1)*a(n - 1). - _Joel B. Lewis_, Sep 30 2012
%F a(n) ~ 2^(3/2) * n^(n-2) / exp(n-3/4). - _Vaclav Kotesovec_, Apr 27 2015
%e For n = 3, the a(3) = 6 ways to partition the deck {1, 1, 2, 2, 3, 4} into three pairs are {11, 22, 34}, {12, 12, 34}, {13, 14, 22}, {11, 23, 24}, {12, 13, 24} and {12, 14, 23}. - _Joel B. Lewis_, Sep 30 2012
%o (PARI)
%o /* b(n) := A002135(n) */
%o b(n) = if(n<3, [1,1,2][n+1], n*b(n-1) - (n-1)*(n-2)*b(n-3)/2 );
%o c(n) = if(n<3, [1,2][n], b(n-1) + (n-1)*b(n-2) + (n-1)*(n-2)*c(n-2) );
%o a(n) = c(n-2);
%o /* _Joerg Arndt_, Apr 07 2013 */
%K nonn
%O 3,2
%A _N. J. A. Sloane_
%E Added more terms, _Joerg Arndt_, Apr 07 2013
|
