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.

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

Original entry on oeis.org

1, 14, 2567, 79544, 1596800, 20789082, 196933710, 1450606028, 8719846960, 44321202192, 195717772000, 767025716736, 2713659864832, 8787898861568
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.

References

  • Jaap Spies, Dancing School Problems, Nieuw Archief voor Wiskunde 5/7 nr. 4, Dec 2006, pp. 283-285.

Crossrefs

Extensions

Corrected by Jaap Spies, Feb 01 2004