|
Search: id:A079916
|
|
|
| A079916 |
|
Solution to the Dancing School Problem with 11 girls and n+11 boys: f(11,n). |
|
+0
1
|
|
| 1, 12, 972, 19640, 260019, 2365772, 16266830, 89700624, 413977192, 1650607040, 5826331440, 18558391936, 54055214144, 145576033920, 365883104080, 865023114560, 1936764883296, 4130528893504, 8433028861040
(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: A114809 A114371 A047802 this_sequence A123283 A004812 A088671
Adjacent sequences: A079913 A079914 A079915 this_sequence A079917 A079918 A079919
|
|
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
|
