This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A079917 #12 Dec 03 2021 18:52:38 %S A079917 1,13,1581,39684,647617,7058469,57031078,363862092,1918222840, %T A079917 8641355080,34132685120,120629547584,387665694976,1145875468544, %U A079917 3145428883520 %N A079917 Solution to the Dancing School Problem with 12 girls and n+12 boys: f(12,n). %C A079917 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. %C A079917 For fixed g, f(g,n) is polynomial in n for n >= g-2. See reference. %H A079917 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 A079917 Jaap Spies, <a href="http://www.jaapspies.nl/mathfiles/dancingschool.pdf">Dancing School Problems, Permanent solutions of Problem 29</a>. %Y A079917 Cf. A079908-A079928. %K A079917 nonn,more %O A079917 0,2 %A A079917 _Jaap Spies_, Jan 28 2003 %E A079917 Corrected by _Jaap Spies_, Feb 01 2004