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 A079918 #11 Dec 03 2021 19:32:00 %S A079918 1,14,2567,79544,1596800,20789082,196933710,1450606028,8719846960, %T A079918 44321202192,195717772000,767025716736,2713659864832,8787898861568 %N A079918 Solution to the Dancing School Problem with 13 girls and n+13 boys: f(13,n). %C A079918 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 A079918 For fixed g, f(g,n) is polynomial in n for n >= g-2. See reference. %D A079918 Jaap Spies, Dancing School Problems, Nieuw Archief voor Wiskunde 5/7 nr. 4, Dec 2006, pp. 283-285. %H A079918 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 A079918 Jaap Spies, <a href="http://www.jaapspies.nl/mathfiles/dancingschool.pdf">Dancing School Problems, Permanent solutions of Problem 29</a>. %Y A079918 Cf. A079908-A079928. %K A079918 nonn,more %O A079918 0,2 %A A079918 _Jaap Spies_, Jan 28 2003 %E A079918 Corrected by _Jaap Spies_, Feb 01 2004