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!)
A079928 Solution to the Dancing School Problem with n girls and n+9 boys: f(n,9). 20
10, 91, 756, 5766, 40688, 268108, 1666000, 9856552, 56010096, 308055528, 1650607040, 8641355080, 44321202192, 223245029176, 1106667645872, 5409040818588, 26108349881112, 124618084809174, 588875653169028 (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: A244203 A002739 A344389 * A346230 A231412 A002452
KEYWORD
nonn
AUTHOR
Jaap Spies, Jan 28 2003
EXTENSIONS
Corrected by Jaap Spies, Feb 01 2004
More terms Dec 15 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 July 24 07:59 EDT 2024. Contains 374575 sequences. (Running on oeis4.)