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!)
A079916 Solution to the Dancing School Problem with 11 girls and n+11 boys: f(11,n). 0
1, 12, 972, 19640, 260019, 2365772, 16266830, 89700624, 413977192, 1650607040, 5826331440, 18558391936, 54055214144, 145576033920, 365883104080, 865023114560, 1936764883296, 4130528893504, 8433028861040 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

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.

For fixed g, f(g,n) is polynomial in n for n >= g-2. See reference.

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=0..18.

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

Jaap Spies, A Bit of Math, The Art of Problem Solving, Jaap Spies Publishers (2019).

CROSSREFS

Cf. A079908-A079928.

Sequence in context: A047802 A278705 A180237 * A204327 A123283 A272855

Adjacent sequences:  A079913 A079914 A079915 * A079917 A079918 A079919

KEYWORD

nonn

AUTHOR

Jaap Spies, Jan 28 2003

EXTENSIONS

Corrected by Jaap Spies, Feb 01 2004

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 April 5 15:53 EDT 2020. Contains 333245 sequences. (Running on oeis4.)