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!)
A172213 Number of ways to place 4 nonattacking knights on a 4 X n board. 6
1, 16, 84, 412, 1416, 3640, 7928, 15384, 27352, 45432, 71480, 107608, 156184, 219832, 301432, 404120, 531288, 686584, 873912, 1097432, 1361560, 1670968, 2030584, 2445592, 2921432 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

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

Explicit formula (Vaclav Kotesovec, 26.1.2010): a(n) = 8*(4n^4-36n^3+170n^2-450n+537)/3, n>=6

G.f.: -x*(16*x^9-20*x^8-40*x^7+172*x^6-81*x^5+41*x^4+142*x^3+14*x^2+11*x+1)/(x-1)^5 [From Vaclav Kotesovec, Mar 25 2010]

MATHEMATICA

CoefficientList[Series[-(16 x^9 - 20 x^8 - 40 x^7 + 172 x^6 - 81 x^5 + 41 x^4 + 142 x^3 + 14 x^2 + 11 x + 1) / (x - 1)^5, {x, 0, 50}], x] (* Vincenzo Librandi, May 27 2013 *)

CROSSREFS

Cf. A172135, A061990, A172212.

Sequence in context: A218082 A159501 A172219 * A231941 A118675 A223962

Adjacent sequences:  A172210 A172211 A172212 * A172214 A172215 A172216

KEYWORD

nonn,easy

AUTHOR

Vaclav Kotesovec, Jan 29 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.)