login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079926 Solution to the Dancing School Problem with n girls and n+7 boys: f(n,7). 2
8, 57, 364, 2106, 11196, 55532, 260720, 1173240, 5112544, 21670160, 89700624, 363862092, 1450606028, 5697401802, 22088730348, 84669409935, 321307769052, 1208513572803, 4509661963752, 16709568237540 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
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.
LINKS
Jaap Spies, Dancing School Problems, Nieuw Archief voor Wiskunde 5/7 nr. 4, Dec 2006, pp. 283-285.
CROSSREFS
Sequence in context: A096711 A282394 A244201 * A346228 A283125 A108666
KEYWORD
nonn
AUTHOR
Jaap Spies, Jan 28 2003
EXTENSIONS
Corrected by Jaap Spies, Feb 01 2004
More terms Dec 14 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 05:37 EDT 2024. Contains 371906 sequences. (Running on oeis4.)