|
Search: id:A079928
|
|
|
| A079928 |
|
Solution to the Dancing School Problem with n girls and n+9 boys: f(n,9). |
|
+0
21
|
|
| 10, 91, 756, 5766, 40688, 268108, 1666000, 9856552, 56010096, 308055528, 1650607040, 8641355080, 44321202192, 223245029176, 1106667645872, 5409040818588, 26108349881112, 124618084809174, 588875653169028
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
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.
|
|
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-A079927.
Sequence in context: A043088 A119047 A002739 this_sequence A002452 A096261 A015455
Adjacent sequences: A079925 A079926 A079927 this_sequence A079929 A079930 A079931
|
|
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
More terms Dec 15 2006
|
|
|
Search completed in 0.002 seconds
|
