This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A202655 #16 Mar 17 2025 15:53:39
%S A202655 0,0,0,7,223,2429,15045,66122,230074,675798,1745318,4073993,8764753,
%T A202655 17630795,33522531,60756612,105666148,177293340,288246972,455749371,
%U A202655 702898611,1060173961,1567213681,2274896558,3247759614,4566786770,6332604226,8669120733,11727651845
%N A202655 Number of ways to place 4 nonattacking semi-queens on an n X n board.
%C A202655 Two semi-queens do not attack each other if they are in the same northwest-southeast diagonal.
%H A202655 Michael De Vlieger, <a href="/A202655/b202655.txt">Table of n, a(n) for n = 1..10000</a>
%H A202655 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 A202655 V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a>
%H A202655 <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (7,-19,21,6,-42,42,-6,-21,19,-7,1).
%F A202655 a(n) = n^8/24 - 2*n^7/3 + 41*n^6/9 - 257*n^5/15 + 341*n^4/9 - 97*n^3/2 + 2341*n^2/72 - 87*n/10 + (n/2 - 1/2)*floor(n/2).
%F A202655 G.f.: -x^4*(151*x^6 + 1022*x^5 + 2233*x^4 + 2132*x^3 + 1001*x^2 + 174*x + 7)/((x-1)^9*(x+1)^2).
%t A202655 Rest@ CoefficientList[Series[-x^4*(151 x^6 + 1022 x^5 + 2233 x^4 + 2132 x^3 + 1001 x^2 + 174 x + 7)/((x - 1)^9*(x + 1)^2), {x, 0, 29}], x] (* _Michael De Vlieger_, Aug 19 2019 *)
%t A202655 LinearRecurrence[{7,-19,21,6,-42,42,-6,-21,19,-7,1},{0,0,0,7,223,2429,15045,66122,230074,675798,1745318},30] (* _Harvey P. Dale_, Mar 17 2025 *)
%Y A202655 Cf. A099152, A061994, A103220, A202654, A202656, A202657.
%K A202655 nonn
%O A202655 1,4
%A A202655 _Vaclav Kotesovec_, Dec 22 2011