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!)
A079915 Solution to the Dancing School Problem with 10 girls and n+10 boys: f(10,n). 1
1, 11, 596, 9627, 103129, 780902, 4557284, 21670160, 87396728, 308055528, 971055240, 2780440664, 7324967640, 17945144328, 41249101928, 89635336440, 185317652664, 366517590440, 696695849928 (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
Jaap Spies, Dancing School Problems, Nieuw Archief voor Wiskunde 5/7 nr. 4, Dec 2006, pp. 283-285.
Jaap Spies, A Bit of Math, The Art of Problem Solving, Jaap Spies Publishers (2019).
FORMULA
for n>=8: a(n) = n^10 -35*n^9 +675*n^8 -8610*n^7 +78435*n^6 -523467*n^5 +2562525*n^4 -9008160*n^3 +21623220*n^2 -31840760*n +21750840.
MAPLE
f:= n-> n^10 -35*n^9 +675*n^8 -8610*n^7 +78435*n^6 -523467*n^5 +2562525*n^4 -9008160*n^3 +21623220*n^2 -31840760*n +21750840: seq(f(i), i=8..21);
CROSSREFS
Sequence in context: A370087 A288326 A260583 * A185656 A142738 A262015
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 10:55 EDT 2024. Contains 371763 sequences. (Running on oeis4.)