A194193 - cp's OEIS frontend

A194193 Square array read by antidiagonals downwards: T(n,k) = number of ways to arrange k indistinguishable points on an n X n square grid so that no three points are collinear at any angle.

n	a(n)
1	1
2	0
3	4
4	0
5	6
6	9
7	0
8	4
9	36
10	16
11	0
12	1
13	76
14	120
15	25
16	0
17	0
18	78
19	516
20	300
21	36
22	0
23	0
24	28
25	1278
26	2148
27	630
28	49
29	0
30	0
31	2
32	1668
33	9498
34	6768
35	1176
36	64
37	0
38	0
39	0
40	998
41	25052
42	47331
43	17600
44	2016
45	81
46	0
47	0
48	0
49	204
50	36698
51	215448
52	175952
53	40120
54	3240
55	100
56	0
57	0
58	0
59	11
60	26700
61	620210

[1, 0, 4, 0, 6, 9, 0, 4, 36, 16, 0, 1, 76, 120, 25, 0, 0, 78, 516, 300, 36, 0, 0, 28, 1278, 2148, 630, 49, 0, 0, 2, 1668, 9498, 6768, 1176, 64, 0, 0, 0, 998, 25052, 47331, 17600, 2016, 81, 0, 0, 0, 204, 36698, 215448, 175952, 40120, 3240, 100, 0, 0, 0, 11, 26700, 620210]

cp's OEIS Frontend

A194193 Square array read by antidiagonals downwards: T(n,k) = number of ways to arrange k indistinguishable points on an n X n square grid so that no three points are collinear at any angle.

Table of values

List of values