|
%I #9 Dec 03 2021 15:44:27
%S 10,91,756,5766,40688,268108,1666000,9856552,56010096,308055528,
%T 1650607040,8641355080,44321202192,223245029176,1106667645872,
%U 5409040818588,26108349881112,124618084809174,588875653169028
%N Solution to the Dancing School Problem with n girls and n+9 boys: f(n,9).
%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-A079927.
%K nonn
%O 1,1
%A _Jaap Spies_, Jan 28 2003
%E Corrected by _Jaap Spies_, Feb 01 2004
%E More terms Dec 15 2006
|
