The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A079922 Solution to the Dancing School Problem with n girls and n+3 boys: f(n,3). 1
 4, 13, 36, 90, 212, 478, 1044, 2227, 4664, 9627, 19640, 39684, 79544, 158364, 313464, 617365, 1210588, 2364713, 4603388, 8934142, 17291756, 33385018, 64311660, 123634471, 237233712, 454429239, 869095472, 1659708488 (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 Table of n, a(n) for n=1..28. Jaap Spies, Dancing School Problems, Permanent solutions of Problem 29, Nieuw Archief voor Wiskunde 5/7 nr. 4, Dec 2006, pp. 283-285. FORMULA Empirical g.f.: -x*(x^7-4*x^4+2*x^3+3*x-4) / ((x-1)^2*(x^3+x^2+x-1)^2). - Colin Barker, Jan 04 2015 CROSSREFS Cf. A079908-A079928. Sequence in context: A328542 A036629 A350642 * A053563 A221882 A235996 Adjacent sequences: A079919 A079920 A079921 * A079923 A079924 A079925 KEYWORD nonn AUTHOR Jaap Spies, Jan 28 2003 EXTENSIONS More terms from Jaap Spies, 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.

Last modified September 7 05:42 EDT 2024. Contains 375729 sequences. (Running on oeis4.)