|
%I #10 Dec 03 2021 17:08:22
%S 9,73,536,3590,22162,127604,693552,3598120,17990600,87396728,
%T 413977192,1918222840,8719846960,38983643908,171764779170,
%U 747190081890,3213760467348,13684132415133,57742830924831,241687792906641
%N Solution to the Dancing School Problem with n girls and n+8 boys: f(n,8).
%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.
%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
%O 1,1
%A _Jaap Spies_, Jan 28 2003
%E Corrected by _Jaap Spies_, Feb 01 2004
%E More terms Dec 14 2006
|
