A274105 - cp's OEIS frontend

A274105 Triangle read by rows: T(n,k) = number of configurations of k nonattacking bishops on the black squares of an n X n chessboard (0 <= k <= n - [n>1]).

n	a(n)
0	1
1	1
2	1
3	1
4	2
5	1
6	5
7	4
8	1
9	8
10	14
11	4
12	1
13	13
14	46
15	46
16	8
17	1
18	18
19	98
20	184
21	100
22	8
23	1
24	25
25	206
26	674
27	836
28	308
29	16
30	1
31	32
32	356
33	1704
34	3532
35	2816
36	632
37	16
38	1
39	41
40	612
41	4196
42	13756
43	20476
44	11896
45	1912
46	32
47	1
48	50
49	940
50	8480
51	38932
52	89256
53	93800
54	37600
55	3856
56	32
57	1
58	61
59	1440
60	16940
61	106772
62	361780
63	629336
64	506600
65	154256
66	11600
67	64

[1, 1, 1, 1, 2, 1, 5, 4, 1, 8, 14, 4, 1, 13, 46, 46, 8, 1, 18, 98, 184, 100, 8, 1, 25, 206, 674, 836, 308, 16, 1, 32, 356, 1704, 3532, 2816, 632, 16, 1, 41, 612, 4196, 13756, 20476, 11896, 1912, 32, 1, 50, 940, 8480, 38932, 89256, 93800, 37600, 3856, 32, 1, 61, 1440, 16940, 106772, 361780, 629336, 506600, 154256, 11600, 64]

cp's OEIS Frontend

A274105 Triangle read by rows: T(n,k) = number of configurations of k nonattacking bishops on the black squares of an n X n chessboard (0 <= k <= n - [n>1]).

Table of values

List of values