A234251 - cp's OEIS frontend

A234251 Triangle T(n, k) = Number of ways to choose k points from an n X n X n triangular grid so that no three of them form a 2 X 2 X 2 subtriangle. Triangle T read by rows.

n	a(n)
1	1
2	1
3	1
4	3
5	3
6	1
7	6
8	15
9	16
10	6
11	1
12	10
13	45
14	111
15	156
16	120
17	42
18	2
19	1
20	15
21	105
22	439
23	1191
24	2154
25	2583
26	1977
27	885
28	189
29	9
30	1
31	21
32	210
33	1305
34	5565
35	17052
36	38337
37	63576
38	77208
39	67285
40	40512
41	15750
42	3480
43	333
44	9
45	1
46	28
47	378
48	3240
49	19620
50	88590
51	307362
52	833228
53	1779219

[1, 1, 1, 3, 3, 1, 6, 15, 16, 6, 1, 10, 45, 111, 156, 120, 42, 2, 1, 15, 105, 439, 1191, 2154, 2583, 1977, 885, 189, 9, 1, 21, 210, 1305, 5565, 17052, 38337, 63576, 77208, 67285, 40512, 15750, 3480, 333, 9, 1, 28, 378, 3240, 19620, 88590, 307362, 833228, 1779219]

cp's OEIS Frontend

A234251 Triangle T(n, k) = Number of ways to choose k points from an n X n X n triangular grid so that no three of them form a 2 X 2 X 2 subtriangle. Triangle T read by rows.

Table of values

List of values