login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079924 Solution to the Dancing School Problem with n girls and n+5 boys: f(n,5). 1
6, 31, 140, 566, 2104, 7364, 24720, 80196, 253072, 780902, 2365772, 7058469, 20789082, 60560175, 174763208, 500245052, 1421824896, 4016278792, 11283371280, 31547434008, 87827653936, 243578509132, 673221043496 (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.

REFERENCES

Jaap Spies, Dancing School Problems, Nieuw Archief voor Wiskunde 5/7 nr. 4, Dec 2006, pp. 283-285.

LINKS

Table of n, a(n) for n=1..23.

Jaap Spies, Dancing School Problems, Permanent solutions of Problem 29.

CROSSREFS

Cf. A079908-A079928.

Sequence in context: A267890 A244199 A128568 * A009076 A291396 A012714

Adjacent sequences:  A079921 A079922 A079923 * A079925 A079926 A079927

KEYWORD

nonn

AUTHOR

Jaap Spies, Jan 28 2003

EXTENSIONS

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 28 06:00 EST 2021. Contains 340490 sequences. (Running on oeis4.)