The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A190395 Number of ways to place 3 nonattacking grasshoppers on a chessboard of size n x n. 5
 0, 4, 76, 516, 2172, 6860, 17904, 40796, 83976, 159732, 285220, 483604, 785316, 1229436, 1865192, 2753580, 3969104, 5601636, 7758396, 10566052, 14172940, 18751404, 24500256, 31647356, 40452312, 51209300, 64250004, 79946676 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The Grasshopper moves on the same lines as a queen, but must jump over a hurdle to land on the square immediately beyond. REFERENCES Christian Poisson, Echecs et mathematiques, Rex Multiplex 29/1990, p.829 LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..1000 V. Kotesovec, Number of ways of placing non-attacking queens, kings, bishops and knights (in English and Czech) FORMULA Explicit formula (C. Poisson, 1990): a(n) = 1/6*(n-1)(n^5 +n^4 -2*n^3 -22*n^2 +76*n -72). G.f.: -4*x^2*(3*x^5 -7*x^4 +4*x^3 +17*x^2 +12*x +1)/(x-1)^7. MATHEMATICA CoefficientList[Series[-4 x (3 x^5 - 7 x^4 + 4 x^3 + 17 x^2 + 12 x + 1) / (x - 1)^7, {x, 0, 50}], x] (* Vincenzo Librandi, Jun 02 2013 *) CROSSREFS Cf. A047659. Sequence in context: A101718 A094160 A045996 * A240281 A114453 A093184 Adjacent sequences:  A190392 A190393 A190394 * A190396 A190397 A190398 KEYWORD nonn,easy AUTHOR Vaclav Kotesovec, May 10 2011 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 11 15:12 EDT 2020. Contains 336428 sequences. (Running on oeis4.)