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.

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

This page as a plain text file.
%I A079927 #10 Dec 03 2021 17:08:22
%S A079927 9,73,536,3590,22162,127604,693552,3598120,17990600,87396728,
%T A079927 413977192,1918222840,8719846960,38983643908,171764779170,
%U A079927 747190081890,3213760467348,13684132415133,57742830924831,241687792906641
%N A079927 Solution to the Dancing School Problem with n girls and n+8 boys: f(n,8).
%C A079927 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 A079927 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 A079927 Jaap Spies, <a href="http://www.jaapspies.nl/mathfiles/dancingschool.pdf">Dancing School Problems, Permanent solutions of Problem 29</a>.
%Y A079927 Cf. A079908-A079928.
%K A079927 nonn
%O A079927 1,1
%A A079927 _Jaap Spies_, Jan 28 2003
%E A079927 Corrected by _Jaap Spies_, Feb 01 2004
%E A079927 More terms Dec 14 2006