|
Search: id:A079911
|
|
|
| A079911 |
|
Solution to the Dancing School Problem with 6 girls and n+6 boys: f(6,n). |
|
+0
1
|
|
| 1, 7, 79, 478, 2108, 7364, 21652, 55532, 127604, 268108, 523244, 960212, 1672972, 2788724, 4475108, 6948124, 10480772, 15412412, 22158844, 31223108, 43207004, 58823332, 78908852, 104437964, 136537108, 176499884, 225802892, 286122292
(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.
J. Spies, SAGE program for computing A079911.
J. Spies, SAGE program for computing the polynomial a(n).
|
|
FORMULA
|
a(0)=1, a(2)=7, a(3)=79, a(n)=n^6-9*n^5+60*n^4-225*n^3+555*n^3-774*n+484
|
|
MAPLE
|
seq(n^6-9*n^5+60*n^4-225*n^3+555*n^2-774*n+484, n=4..40);
|
|
CROSSREFS
|
Cf. A079908-A079928.
Adjacent sequences: A079908 A079909 A079910 this_sequence A079912 A079913 A079914
Sequence in context: A135051 A014232 A075896 this_sequence A003545 A104094 A036950
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jaap Spies (j.spies(AT)hccnet.nl), Jan 28 2003
|
|
|
Search completed in 0.002 seconds
|
