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.

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

Original entry on oeis.org

5, 21, 76, 246, 738, 2108, 5794, 15458, 40296, 103129, 260019, 647617, 1596800, 3904260, 9479292, 22879520, 54947836, 131406732, 313129592, 743878505, 1762572329, 4167010597, 9832766588, 23164353834
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

More terms from Jaap Spies, Dec 14 2006