login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079924 Solution to the Dancing School Problem with n girls and n+5 boys: f(n,5). 1

%I #11 Jan 03 2022 21:20:45

%S 6,31,140,566,2104,7364,24720,80196,253072,780902,2365772,7058469,

%T 20789082,60560175,174763208,500245052,1421824896,4016278792,

%U 11283371280,31547434008,87827653936,243578509132,673221043496

%N Solution to the Dancing School Problem with n girls and n+5 boys: f(n,5).

%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.

%D Jaap Spies, Dancing School Problems, Nieuw Archief voor Wiskunde 5/7 nr. 4, Dec 2006, pp. 283-285.

%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 More terms from _Jaap Spies_, Dec 14 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)