|
Search: id:A079926
|
|
|
| A079926 |
|
Solution to the Dancing School Problem with n girls and n+7 boys: f(n,7). |
|
+0
1
|
|
| 8, 57, 364, 2106, 11196, 55532, 260720, 1173240, 5112544, 21670160, 89700624, 363862092, 1450606028, 5697401802, 22088730348, 84669409935, 321307769052, 1208513572803, 4509661963752, 16709568237540
(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-A079928.
Sequence in context: A009089 A043071 A096711 this_sequence A108666 A023000 A097114
Adjacent sequences: A079923 A079924 A079925 this_sequence A079927 A079928 A079929
|
|
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 14 2006
|
|
|
Search completed in 0.002 seconds
|
