A194485 - cp's OEIS frontend

A194485 T(n,k) = number of ways to arrange k indistinguishable points on an n X n X n triangular grid so that no four points are in the same row or diagonal.

n	a(n)
1	1
2	0
3	3
4	0
5	3
6	6
7	0
8	1
9	15
10	10
11	0
12	0
13	20
14	45
15	15
16	0
17	0
18	15
19	120
20	105
21	21
22	0
23	0
24	6
25	207
26	455
27	210
28	28
29	0
30	0
31	1
32	234
33	1347
34	1330
35	378
36	36
37	0
38	0
39	0
40	165
41	2817
42	5922
43	3276
44	630
45	45
46	0
47	0
48	0
49	63
50	4135
51	19362
52	20307
53	7140
54	990
55	55
56	0
57	0
58	0
59	9
60	4080
61	47010
62	94584
63	58527
64	14190
65	1485

[1, 0, 3, 0, 3, 6, 0, 1, 15, 10, 0, 0, 20, 45, 15, 0, 0, 15, 120, 105, 21, 0, 0, 6, 207, 455, 210, 28, 0, 0, 1, 234, 1347, 1330, 378, 36, 0, 0, 0, 165, 2817, 5922, 3276, 630, 45, 0, 0, 0, 63, 4135, 19362, 20307, 7140, 990, 55, 0, 0, 0, 9, 4080, 47010, 94584, 58527, 14190, 1485]

cp's OEIS Frontend

A194485 T(n,k) = number of ways to arrange k indistinguishable points on an n X n X n triangular grid so that no four points are in the same row or diagonal.

Table of values

List of values