login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A172138 Number of ways to place 3 nonattacking zebras on an n X n board. 6
0, 4, 84, 452, 1772, 5596, 14888, 34640, 72712, 140716, 255036, 437968, 718980, 1136092, 1737376, 2582576, 3744848, 5312620, 7391572, 10106736, 13604716, 18056028, 23657560, 30635152, 39246296, 49782956, 62574508, 77990800 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Zebra is a (fairy chess) leaper [2,3].

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

V. Kotesovec, Number of ways of placing non-attacking queens and kings on boards of various sizes

FORMULA

a(n) = (n^6 - 27n^4 + 120n^3 + 74n^2 - 1608n + 2976)/6, n >=6.

G.f.: 4*x^2*(4*x^10-23*x^9+45*x^8-33*x^7-x^6+9*x^5+29*x^4-58*x^3+13*x^2-14*x-1)/(x-1)^7. - Vaclav Kotesovec, Mar 25 2010

MATHEMATICA

CoefficientList[Series[4 x (4 x^10 - 23 x^9 + 45 x^8 - 33 x^7 - x^6 + 9 x^5 + 29 x^4 - 58 x^3 + 13 x^2 - 14 x - 1) / (x - 1)^7, {x, 0, 40}], x] (* Vincenzo Librandi, May 27 2013 *)

CROSSREFS

Cf. A047659, A172124, A172134, A172137.

Sequence in context: A316490 A102982 A231741 * A282588 A178208 A069441

Adjacent sequences:  A172135 A172136 A172137 * A172139 A172140 A172141

KEYWORD

nonn,easy

AUTHOR

Vaclav Kotesovec, Jan 26 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 18 20:06 EST 2018. Contains 318245 sequences. (Running on oeis4.)