login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

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

%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).

%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).]

%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.

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 06:14 EST 2021. Contains 349563 sequences. (Running on oeis4.)