login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A202654 Number of ways to place 3 nonattacking semi-queens on an n X n board. 5

%I #14 Aug 19 2019 16:07:52

%S 0,0,3,52,370,1620,5285,14168,33012,69240,133815,242220,415558,681772,

%T 1076985,1646960,2448680,3552048,5041707,7018980,9603930,12937540,

%U 17184013,22533192,29203100,37442600,47534175,59796828,74589102,92312220,113413345,138388960

%N Number of ways to place 3 nonattacking semi-queens on an n X n board.

%C Two semi-queens do not attack each other if they are in the same northwest-southeast diagonal.

%H Michael De Vlieger, <a href="/A202654/b202654.txt">Table of n, a(n) for n = 1..10000</a>

%H Christopher R. H. Hanusa, Thomas Zaslavsky, <a href="https://arxiv.org/abs/1906.08981">A q-queens problem. VII. Combinatorial types of nonattacking chess riders</a>, arXiv:1906.08981 [math.CO], 2019.

%H V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a>

%F a(n) = 1/6*(n-2)*(n-1)*n*(n^3-5*n^2+8*n-3).

%F G.f.: -x^3*(17*x^3 + 69*x^2 + 31*x + 3)/(x-1)^7.

%t Rest@ CoefficientList[Series[-x^3*(17 x^3 + 69 x^2 + 31 x + 3)/(x - 1)^7, {x, 0, 32}], x] (* _Michael De Vlieger_, Aug 19 2019 *)

%Y Cf. A099152, A047659, A103220, A202655, A202656, A202657.

%K nonn

%O 1,3

%A _Vaclav Kotesovec_, Dec 22 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 02:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)