login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079918 Solution to the Dancing School Problem with 13 girls and n+13 boys: f(13,n). 1
1, 14, 2567, 79544, 1596800, 20789082, 196933710, 1450606028, 8719846960, 44321202192, 195717772000, 767025716736, 2713659864832, 8787898861568 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
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.
For fixed g, f(g,n) is polynomial in n for n >= g-2. See reference.
REFERENCES
Jaap Spies, Dancing School Problems, Nieuw Archief voor Wiskunde 5/7 nr. 4, Dec 2006, pp. 283-285.
LINKS
Jaap Spies, Dancing School Problems, Nieuw Archief voor Wiskunde 5/7 nr. 4, Dec 2006, pp. 283-285.
CROSSREFS
Sequence in context: A183580 A080690 A268424 * A199648 A271401 A013719
KEYWORD
nonn,more
AUTHOR
Jaap Spies, Jan 28 2003
EXTENSIONS
Corrected by Jaap Spies, Feb 01 2004
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 06:58 EDT 2024. Contains 371906 sequences. (Running on oeis4.)