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!)
A172530 Number of ways to place 3 nonattacking knights on an n X n toroidal board. 6
0, 0, 6, 208, 600, 3252, 10584, 27584, 61992, 125300, 233772, 409584, 682084, 1089172, 1678800, 2510592, 3657584, 5208084, 7267652, 9961200, 13435212, 17860084, 23432584, 30378432, 38955000, 49454132, 62205084 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,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^2*(n^4 - 27*n^2 + 218)/6, n>=6.

G.f.: -2*x^3 * (50*x^9 -398*x^8 +1425*x^7 -2989*x^6 +3971*x^5 -3325*x^4 +1605*x^3 -365*x^2 +83*x +3) / (x-1)^7. - Vaclav Kotesovec, Mar 25 2010

MATHEMATICA

CoefficientList[Series[- 2 x^2 (50 x^9 - 398 x^8 + 1425 x^7 - 2989 x^6 + 3971 x^5 - 3325 x^4 + 1605 x^3 - 365 x^2 + 83 x + 3) / (x - 1)^7, {x, 0, 40}], x] (* Vincenzo Librandi, May 29 2013 *)

CROSSREFS

Cf. A172529, A172134, A172518.

Sequence in context: A159307 A284768 A024083 * A201237 A120436 A136742

Adjacent sequences:  A172527 A172528 A172529 * A172531 A172532 A172533

KEYWORD

nonn,easy

AUTHOR

Vaclav Kotesovec, Feb 06 2010

EXTENSIONS

More terms from Vincenzo Librandi, May 29 2013

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 17 08:14 EST 2018. Contains 318192 sequences. (Running on oeis4.)