A235453 - cp's OEIS frontend

A235453 Triangle T(n, k) = Number of non-equivalent (mod D_4) ways to arrange k indistinguishable points on an n X n square grid so that no three of them are collinear. Triangle read by rows.

n	a(n)
1	1
2	0
3	1
4	2
5	1
6	1
7	3
8	8
9	13
10	15
11	5
12	1
13	3
14	21
15	70
16	181
17	217
18	142
19	28
20	4
21	6
22	49
23	290
24	1253
25	3192
26	4699
27	3385
28	1076
29	110
30	5
31	6
32	93
33	867
34	6044
35	27041
36	77970
37	134353
38	129929
39	62177
40	12511
41	717
42	11
43	10
44	171
45	2266
46	22302
47	149217
48	672506
49	1958674
50	3531747
51	3695848
52	2068757

[1, 0, 1, 2, 1, 1, 3, 8, 13, 15, 5, 1, 3, 21, 70, 181, 217, 142, 28, 4, 6, 49, 290, 1253, 3192, 4699, 3385, 1076, 110, 5, 6, 93, 867, 6044, 27041, 77970, 134353, 129929, 62177, 12511, 717, 11, 10, 171, 2266, 22302, 149217, 672506, 1958674, 3531747, 3695848, 2068757]

cp's OEIS Frontend

A235453 Triangle T(n, k) = Number of non-equivalent (mod D_4) ways to arrange k indistinguishable points on an n X n square grid so that no three of them are collinear. Triangle read by rows.

Table of values

List of values