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.

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

Original entry on oeis.org

10, 91, 756, 5766, 40688, 268108, 1666000, 9856552, 56010096, 308055528, 1650607040, 8641355080, 44321202192, 223245029176, 1106667645872, 5409040818588, 26108349881112, 124618084809174, 588875653169028
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 15 2006