A288182 - cp's OEIS frontend

A288182 Triangle read by rows: T(n,k) = number of arrangements of k non-attacking bishops on the white squares of an n X n board with every square controlled by at least one bishop (1<=k

n	a(n)
2	2
3	0
4	2
5	0
6	4
7	4
8	0
9	2
10	16
11	4
12	0
13	0
14	16
15	64
16	8
17	0
18	0
19	0
20	128
21	160
22	8
23	0
24	0
25	0
26	72
27	784
28	528
29	16
30	0
31	0
32	0
33	24
34	864
35	3672
36	1152
37	16
38	0
39	0
40	0
41	0
42	432
43	9072
44	18336
45	3584
46	32
47	0
48	0
49	0
50	0
51	0
52	8304
53	65664
54	69472
55	7424
56	32
57	0
58	0
59	0
60	0
61	0
62	2880
63	109152
64	484416
65	313856
66	22592
67	64

[2, 0, 2, 0, 4, 4, 0, 2, 16, 4, 0, 0, 16, 64, 8, 0, 0, 0, 128, 160, 8, 0, 0, 0, 72, 784, 528, 16, 0, 0, 0, 24, 864, 3672, 1152, 16, 0, 0, 0, 0, 432, 9072, 18336, 3584, 32, 0, 0, 0, 0, 0, 8304, 65664, 69472, 7424, 32, 0, 0, 0, 0, 0, 2880, 109152, 484416, 313856, 22592, 64]

cp's OEIS Frontend

A288182 Triangle read by rows: T(n,k) = number of arrangements of k non-attacking bishops on the white squares of an n X n board with every square controlled by at least one bishop (1<=k

Table of values

List of values