cp's OEIS Frontend

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.

A079926 Solution to the Dancing School Problem with n girls and n+7 boys: f(n,7).

This page as a plain text file.
%I A079926 #9 Dec 03 2021 15:44:19
%S A079926 8,57,364,2106,11196,55532,260720,1173240,5112544,21670160,89700624,
%T A079926 363862092,1450606028,5697401802,22088730348,84669409935,321307769052,
%U A079926 1208513572803,4509661963752,16709568237540
%N A079926 Solution to the Dancing School Problem with n girls and n+7 boys: f(n,7).
%C A079926 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 A079926 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 A079926 Jaap Spies, <a href="http://www.jaapspies.nl/mathfiles/dancingschool.pdf">Dancing School Problems, Permanent solutions of Problem 29</a>.
%Y A079926 Cf. A079908-A079928.
%K A079926 nonn
%O A079926 1,1
%A A079926 _Jaap Spies_, Jan 28 2003
%E A079926 Corrected by _Jaap Spies_, Feb 01 2004
%E A079926 More terms Dec 14 2006