A146304 - cp's OEIS frontend

A146304 Number of distinct ways to place bishops (up to 2n-2) on an n X n chessboard so that no bishop is attacking another and that it is not possible to add another bishop.

n	a(n)
1	1
2	4
3	10
4	64
5	660
6	7744
7	111888
8	1960000
9	40829184
10	989479936
11	27559645440
12	870414361600
13	30942459270912
14	1225022400102400
15	53716785891102720
16	2589137004664520704
17	136573353235553058816
18	7838079929528363843584
19	487668908919708442951680
20	32741107405951528945844224

[1, 4, 10, 64, 660, 7744, 111888, 1960000, 40829184, 989479936, 27559645440, 870414361600, 30942459270912, 1225022400102400, 53716785891102720, 2589137004664520704, 136573353235553058816, 7838079929528363843584, 487668908919708442951680, 32741107405951528945844224]

cp's OEIS Frontend

A146304 Number of distinct ways to place bishops (up to 2n-2) on an n X n chessboard so that no bishop is attacking another and that it is not possible to add another bishop.

Table of values

List of values