|
Search: id:A079918
|
|
|
| A079918 |
|
Solution to the Dancing School Problem with 13 girls and n+13 boys: f(13,n). |
|
+0
1
|
|
| 1, 14, 2567, 79544, 1596800, 20789082, 196933710, 1450606028, 8719846960, 44321202192, 195717772000, 767025716736, 2713659864832, 8787898861568
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
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, p. 283-285.
|
|
LINKS
|
Jaap Spies, Dancing School Problems, Permanent solutions of Problem 29.
|
|
CROSSREFS
|
Cf. A079908-A079928.
Sequence in context: A134814 A015515 A080690 this_sequence A013719 A145188 A064075
Adjacent sequences: A079915 A079916 A079917 this_sequence A079919 A079920 A079921
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jaap Spies (j.spies(AT)hccnet.nl), Jan 28 2003
|
|
EXTENSIONS
|
Corrected by Jaap Spies (j.spies(AT)hccnet.nl), Feb 01 2004
|
|
|
Search completed in 0.002 seconds
|
