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.

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

Original entry on oeis.org

7, 43, 234, 1146, 5150, 21652, 86608, 334072, 1249768, 4557284, 16266830, 57031078, 196933710, 671224467, 2262089361, 7548882573, 24975936372, 82012110724, 267505920876, 867390073384
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