The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A079917 Solution to the Dancing School Problem with 12 girls and n+12 boys: f(12,n). 0
 1, 13, 1581, 39684, 647617, 7058469, 57031078, 363862092, 1918222840, 8641355080, 34132685120, 120629547584, 387665694976, 1145875468544, 3145428883520 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS 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. For fixed g, f(g,n) is polynomial in n for n >= g-2. See reference. REFERENCES Jaap Spies, Dancing School Problems, Nieuw Archief voor Wiskunde 5/7 nr. 4, Dec 2006, pp. 283-285. LINKS CROSSREFS Cf. A079908-A079928. Sequence in context: A066457 A203515 A166929 * A028450 A201177 A015513 Adjacent sequences:  A079914 A079915 A079916 * A079918 A079919 A079920 KEYWORD nonn AUTHOR Jaap Spies, Jan 28 2003 EXTENSIONS Corrected by Jaap Spies, Feb 01 2004 STATUS approved

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

Last modified February 20 19:02 EST 2020. Contains 332082 sequences. (Running on oeis4.)