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!)
A005634 Bishops on an n X n board (see Robinson paper for details).
(Formerly M3621)
1

%I M3621 #26 Jan 20 2024 19:18:14

%S 0,0,1,4,28,85,630,3096,23220,123952,1036080,7230828,66349440,

%T 500721252,5080269600,45925520096,508031496000,4919774752448,

%U 59256847036800,656763354386032,8532986691801600,100525956801641104,1405335512577427200,18431883446961030912

%N Bishops on an n X n board (see Robinson paper for details).

%C The problem of the bishops is to determine the number of inequivalent arrangements of n bishops on an n X n chessboard such that no bishop threatens another and every unoccupied square is threatened by some bishop. Two arrangements are considered equivalent if they are isomorphic by way of one of the eight symmetries of the chessboard. - _Jean-François Alcover_, Jul 24 2022 (after Robinson's paper).

%D R. W. Robinson, Counting arrangements of bishops, pp. 198-214 of Combinatorial Mathematics IV (Adelaide 1975), Lect. Notes Math., 560 (1976). [The sequence epsilon(n) page 212.]

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H R. W. Robinson, <a href="/A000899/a000899_1.pdf">Counting arrangements of bishops</a>, pp. 198-214 of Combinatorial Mathematics IV (Adelaide 1975), Lect. Notes Math., 560 (1976). (Annotated scanned copy)

%p For Maple program see A005635.

%t e[n_] := Module[{k}, If[Mod[n, 2] == 0, k = n/2; If[Mod[k, 2] == 0, Return[(k!*(k + 2)/2)^2], Return[((k - 1)!*(k + 1)^2/2)^2]], k = (n - 1)/2; If[Mod[k, 2] == 0, Return[((k!)^2/12)*(3*k^3 + 16*k^2 + 18*k + 8)], Return[((k - 1)!*(k + 1)!/12)*(3*k^3 + 13*k^2 - k - 3)]]]];

%t c[n_] := Module[{k}, If[Mod[n, 2]==0, Return[0]]; k = (n-1)/2; If[Mod[k, 2] == 0, Return[k*2^(k-1)*((k/2)!)^2], Return[2^k*(((k+1)/2)!)^2]]];

%t d[n_] := d[n] = If[n <= 1, 1, d[n - 1] + (n - 1)*d[n - 2]];

%t B[n_] := B[n] = Which[n == 0 || n == -2, 1, OddQ[n], B[n - 1], True, 2*B[n - 2] + (n - 2)*B[n - 4]];

%t S[n_] := S[n] = Module[{k}, If[Mod[n, 2]==0, 0, k = (n-1)/2; B[k]*B[k+1]]];

%t M[n_] := Module[{k}, If[Mod[n, 2] == 0, k = n/2; If[Mod[k, 2] == 0, Return[k!*(k + 2)/2], Return[(k - 1)!*(k + 1)^2/2]], k = (n - 1)/2; Return[d[k]*d[k + 1]]]];

%t a[n_] := e[n]/8 - c[n]/8 + S[n]/4 - M[n]/4;

%t Table[a[n], {n, 2, 30}] (* _Jean-François Alcover_, Jul 23 2022, after Maple program in A005635 *)

%K nonn

%O 2,4

%A _N. J. A. Sloane_

%E More terms from _N. J. A. Sloane_, Sep 28 2006

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 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)