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.

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

Original entry on oeis.org

1, 13, 1581, 39684, 647617, 7058469, 57031078, 363862092, 1918222840, 8641355080, 34132685120, 120629547584, 387665694976, 1145875468544, 3145428883520
Offset: 0

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.
For fixed g, f(g,n) is polynomial in n for n >= g-2. See reference.

Crossrefs

Extensions

Corrected by Jaap Spies, Feb 01 2004