A239567 - cp's OEIS frontend

A239567 Triangle T(n, k) = Numbers of ways to place k points on a triangular grid of side n so that no two of them are adjacent. Triangle read by rows.

n	a(n)
1	1
2	3
3	6
4	6
5	1
6	10
7	27
8	21
9	1
10	15
11	75
12	151
13	114
14	27
15	1
16	21
17	165
18	615
19	1137
20	999
21	353
22	27
23	28
24	315
25	1845
26	6100
27	11565
28	12231
29	6715
30	1686
31	150
32	2
33	36
34	546
35	4571
36	23265
37	74811
38	153194
39	196899
40	153072
41	67229
42	14727
43	1257
44	28
45	45
46	882
47	9926
48	71211
49	342042
50	1124820

[1, 3, 6, 6, 1, 10, 27, 21, 1, 15, 75, 151, 114, 27, 1, 21, 165, 615, 1137, 999, 353, 27, 28, 315, 1845, 6100, 11565, 12231, 6715, 1686, 150, 2, 36, 546, 4571, 23265, 74811, 153194, 196899, 153072, 67229, 14727, 1257, 28, 45, 882, 9926, 71211, 342042, 1124820]

cp's OEIS Frontend

A239567 Triangle T(n, k) = Numbers of ways to place k points on a triangular grid of side n so that no two of them are adjacent. Triangle read by rows.

Table of values

List of values