|
Search: id:A079910
|
|
|
| A079910 |
|
Solution to the Dancing School Problem with 5 girls and n+5 boys: f(5,n). |
|
+0
1
|
|
| 1, 6, 46, 212, 738, 2104, 5150, 11196, 22162, 40688, 70254, 115300, 181346, 275112, 404638, 579404, 810450, 1110496, 1494062, 1977588, 2579554, 3320600, 4223646, 5314012, 6619538, 8170704, 10000750, 12145796, 14644962, 17540488, 20877854
(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 A079910.
J. Spies, SAGE program for computing the polynomial a(n).
|
|
FORMULA
|
a(0)=1, a(1)=6, a(2)=46, a(n)=n^5-5*n^4+25*n^3-55*n^2+80*n-46.
|
|
CROSSREFS
|
Cf. A079908-A079928.
Adjacent sequences: A079907 A079908 A079909 this_sequence A079911 A079912 A079913
Sequence in context: A078865 A086721 A043076 this_sequence A103768 A073507 A084772
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jaap Spies (j.spies(AT)hccnet.nl), Jan 28 2003
|
|
EXTENSIONS
|
More terms from Benoit Cloitre, Jan 29, 2003
|
|
|
Search completed in 0.002 seconds
|
