|
%I #12 Jan 06 2018 11:05:12
%S 3,8,324,1728,216000,1728000,444528000,4741632000,2073989836800,
%T 27653197824000,18403203151872000,294451250429952000,
%U 277246884511973376000,5175275177556836352000,6549957646595371008000000,139732429794034581504000000,228835142526030632976384000000
%N Number of maximum matchings in the complete tripartite graph K_n,n,n.
%C For even n, a maximum matching will be a perfect matching. For odd n there will be one unmatched vertex. - _Andrew Howroyd_, Jan 01 2018
%H Andrew Howroyd, <a href="/A297527/b297527.txt">Table of n, a(n) for n = 1..100</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/CompleteTripartiteGraph.html">Complete Tripartite Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Matching.html">Matching</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MaximumIndependentEdgeSet.html">Maximum Independent Edge Set</a>
%F a(n) = binomial(n, floor(n/2))^3 * floor(n/2)! * ceiling(n/2)!^2 * (2-(-1)^n). - _Andrew Howroyd_, Jan 01 2018
%F -8*(n+2)*(9*n^2+34*n+30)*(n+1)^3*a(n)+12*(n+2)*(n^2+5*n+5)*a(n+1)+(n+3)*(9*n^2+16*n+5)*a(n+2) = 0. - _Eric W. Weisstein_, Jan 06 2018
%t Table[Binomial[n, Floor[n/2]]^3 Floor[n/2]! Ceiling[n/2]!^2 (2 - (-1)^n), {n, 20}]
%t RecurrenceTable[{-8 (1 + n)^3 (2 + n) (30 + 34 n + 9 n^2) a[n] + 12 (2 + n) (5 + 5 n + n^2) a[1 + n] + (3 + n) (5 + 16 n + 9 n^2) a[2 + n] == 0, a[1] == 3, a[2] == 8}, a[n], {n, 20}]
%o (PARI) a(n)={if(n%2==0, binomial(n,n/2)^3*(n/2)!^3, 3*binomial(n,(n-1)/2)^3*((n+1)/2)!^2*((n-1)/2)!)} \\ _Andrew Howroyd_, Jan 01 2018
%Y Cf. A293075, A297008, A297487.
%K nonn
%O 1,1
%A _Eric W. Weisstein_, Dec 31 2017
%E Terms a(11) and beyond from _Andrew Howroyd_, Jan 01 2018
| 