A194480 - cp's OEIS frontend

A194480 T(n,k) = number of ways to arrange k indistinguishable points on an n X n X n triangular grid so that no three 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	17
14	45
15	15
16	0
17	0
18	6
19	105
20	105
21	21
22	0
23	0
24	0
25	114
26	410
27	210
28	28
29	0
30	0
31	0
32	39
33	879
34	1225
35	378
36	36
37	0
38	0
39	0
40	1
41	909
42	4284
43	3066
44	630
45	45
46	0
47	0
48	0
49	0
50	337
51	8568
52	15729
53	6762
54	990
55	55
56	0
57	0
58	0
59	0
60	15
61	8733
62	50526
63	47565
64	13560
65	1485
66	66
67	0
68	0
69	0

[1, 0, 3, 0, 3, 6, 0, 1, 15, 10, 0, 0, 17, 45, 15, 0, 0, 6, 105, 105, 21, 0, 0, 0, 114, 410, 210, 28, 0, 0, 0, 39, 879, 1225, 378, 36, 0, 0, 0, 1, 909, 4284, 3066, 630, 45, 0, 0, 0, 0, 337, 8568, 15729, 6762, 990, 55, 0, 0, 0, 0, 15, 8733, 50526, 47565, 13560, 1485, 66, 0, 0, 0]

cp's OEIS Frontend

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

Table of values

List of values