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!)
A079925 Solution to the Dancing School Problem with n girls and n+6 boys: f(n,6). 1
7, 43, 234, 1146, 5150, 21652, 86608, 334072, 1249768, 4557284, 16266830, 57031078, 196933710, 671224467, 2262089361, 7548882573, 24975936372, 82012110724, 267505920876, 867390073384 (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: A027176 A244200 A334241 * A126718 A346227 A081896
KEYWORD
nonn,more
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 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)