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.

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

This page as a plain text file.
%I A079923 #11 Jan 03 2022 21:20:51
%S A079923 5,21,76,246,738,2108,5794,15458,40296,103129,260019,647617,1596800,
%T A079923 3904260,9479292,22879520,54947836,131406732,313129592,743878505,
%U A079923 1762572329,4167010597,9832766588,23164353834
%N A079923 Solution to the Dancing School Problem with n girls and n+4 boys: f(n,4).
%C A079923 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 A079923 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 A079923 Jaap Spies, <a href="http://www.jaapspies.nl/mathfiles/dancingschool.pdf">Dancing School Problems, Permanent solutions of Problem 29</a>.
%Y A079923 Cf. A079908-A079928.
%K A079923 nonn
%O A079923 1,1
%A A079923 _Jaap Spies_, Jan 28 2003
%E A079923 More terms from _Jaap Spies_, Dec 14 2006