|
%I #12 Dec 03 2021 18:49:13
%S 7,43,234,1146,5150,21652,86608,334072,1249768,4557284,16266830,
%T 57031078,196933710,671224467,2262089361,7548882573,24975936372,
%U 82012110724,267505920876,867390073384
%N Solution to the Dancing School Problem with n girls and n+6 boys: f(n,6).
%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,more
%O 1,1
%A _Jaap Spies_, Jan 28 2003
%E Corrected by _Jaap Spies_, Feb 01 2004
%E More terms Dec 14 2006
|
