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.

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

Original entry on oeis.org

1, 12, 972, 19640, 260019, 2365772, 16266830, 89700624, 413977192, 1650607040, 5826331440, 18558391936, 54055214144, 145576033920, 365883104080, 865023114560, 1936764883296, 4130528893504, 8433028861040
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