|
Search: id:A079920
|
|
|
| A079920 |
|
Solution to the Dancing School Problem with 15 girls and n+15 boys: f(15,n). |
|
+0
1
|
|
| 1, 16, 6746, 313464, 9479292, 174763208, 2262089361, 22088730348, 171764779170, 1106667645872, 6087616677864, 29267369636800
(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: A017008 A097547 A088654 this_sequence A069986 A006448 A017092
Adjacent sequences: A079917 A079918 A079919 this_sequence A079921 A079922 A079923
|
|
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
|
