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.

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

Original entry on oeis.org

9, 73, 536, 3590, 22162, 127604, 693552, 3598120, 17990600, 87396728, 413977192, 1918222840, 8719846960, 38983643908, 171764779170, 747190081890, 3213760467348, 13684132415133, 57742830924831, 241687792906641
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