|
%I #12 Dec 03 2021 18:52:38
%S 1,13,1581,39684,647617,7058469,57031078,363862092,1918222840,
%T 8641355080,34132685120,120629547584,387665694976,1145875468544,
%U 3145428883520
%N Solution to the Dancing School Problem with 12 girls and n+12 boys: f(12,n).
%C f(g,h) = per(B), the permanent of the (0,1)-matrix B of size g X g+h with b(i,j)=1 if and only if i <= j <= i+h. See A079908 for more information.
%C For fixed g, f(g,n) is polynomial in n for n >= g-2. See reference.
%H Jaap Spies, <a href="http://www.nieuwarchief.nl/serie5/pdf/naw5-2006-07-4-283.pdf">Dancing School Problems</a>, Nieuw Archief voor Wiskunde 5/7 nr. 4, Dec 2006, pp. 283-285.
%H Jaap Spies, <a href="http://www.jaapspies.nl/mathfiles/dancingschool.pdf">Dancing School Problems, Permanent solutions of Problem 29</a>.
%Y Cf. A079908-A079928.
%K nonn,more
%O 0,2
%A _Jaap Spies_, Jan 28 2003
%E Corrected by _Jaap Spies_, Feb 01 2004
|
