|
| |
|
|
A079919
|
|
Solution to the Dancing School Problem with 14 girls and n+14 boys: f(14,n).
|
|
0
|
|
|
|
1, 15, 4163, 158364, 3904260, 60560175, 671224467, 5697401802, 38983643908, 223245029176, 1100925116264, 4780871048064, 18612106195456
(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, p. 283-285.
|
|
|
LINKS
|
Table of n, a(n) for n=0..12.
Jaap Spies, Dancing School Problems, Permanent solutions of Problem 29.
|
|
|
CROSSREFS
|
Cf. A079908-A079928.
Sequence in context: A208469 A070907 A208053 * A027513 A191642 A206387
Adjacent sequences: A079916 A079917 A079918 * A079920 A079921 A079922
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Jaap Spies, Jan 28 2003
|
|
|
EXTENSIONS
|
Corrected by Jaap Spies, Feb 01 2004
|
|
|
STATUS
|
approved
|
| |
|
|
