This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A178842 a(n) = C((n-1)^2, n) 0
 0, 0, 4, 126, 4368, 177100, 8347680, 450978066, 27540584512, 1878392407320, 141629804643600, 11703541346076580, 1052134368066259632, 102250849636865496528, 10683770265451303535424, 1194448077521704400002650, 142288257910903254700704000, 17993390003427864738863790640 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Number of ways to place n objects in an (n-1) X (n-1) array (e.g., the number of ways to arrange stars in a flag's field pattern). LINKS MATHEMATICA f[n_] := Binomial[(n - 1)^2, n]; Array[f, 18] (* Robert G. Wilson v, Jul 25 2010 *) CROSSREFS Sequence in context: A116944 A124260 A253099 * A054053 A070781 A152421 Adjacent sequences:  A178839 A178840 A178841 * A178843 A178844 A178845 KEYWORD nonn AUTHOR Thomas Young, Jun 17 2010 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.