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.

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

Original entry on oeis.org

6, 31, 140, 566, 2104, 7364, 24720, 80196, 253072, 780902, 2365772, 7058469, 20789082, 60560175, 174763208, 500245052, 1421824896, 4016278792, 11283371280, 31547434008, 87827653936, 243578509132, 673221043496
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.

References

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

Crossrefs

Extensions

More terms from Jaap Spies, Dec 14 2006