A079916 Solution to the Dancing School Problem with 11 girls and n+11 boys: f(11,n).

1, 12, 972, 19640, 260019, 2365772, 16266830, 89700624, 413977192, 1650607040, 5826331440, 18558391936, 54055214144, 145576033920, 365883104080, 865023114560, 1936764883296, 4130528893504, 8433028861040

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.

Links

Table of n, a(n) for n=0..18.

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

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 A370313 A123283

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