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).

Original entry on oeis.org

8, 57, 364, 2106, 11196, 55532, 260720, 1173240, 5112544, 21670160, 89700624, 363862092, 1450606028, 5697401802, 22088730348, 84669409935, 321307769052, 1208513572803, 4509661963752, 16709568237540
Offset: 1

Views

Author

Jaap Spies, Jan 28 2003

Keywords

Comments

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.

Crossrefs

Extensions

Corrected by Jaap Spies, Feb 01 2004
More terms Dec 14 2006