|
%I #14 Dec 03 2021 17:08:16
%S 1,12,972,19640,260019,2365772,16266830,89700624,413977192,1650607040,
%T 5826331440,18558391936,54055214144,145576033920,365883104080,
%U 865023114560,1936764883296,4130528893504,8433028861040
%N Solution to the Dancing School Problem with 11 girls and n+11 boys: f(11,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>.
%H Jaap Spies, <a href="http://www.jaapspies.nl/bookb5.pdf">A Bit of Math, The Art of Problem Solving</a>, Jaap Spies Publishers (2019).
%Y Cf. A079908-A079928.
%K nonn
%O 0,2
%A _Jaap Spies_, Jan 28 2003
%E Corrected by _Jaap Spies_, Feb 01 2004
|
