A346446 - cp's OEIS frontend

A346446 Irregular triangle read by rows: T(n,k) = number of k-sided polygons formed when connecting infinite lines between all vertices and all points that divide the sides of an equilateral triangle into n equal parts, for k = 3, 4, ..., max_k.

n	a(n)
1	1
2	12
3	75
4	24
5	3
6	258
7	132
8	6
9	621
10	525
11	33
12	19
13	1308
14	1272
15	144
16	24
17	2505
18	2628
19	345
20	61
21	4434
22	4734
23	984
24	102
25	12
26	6
27	7365
28	7992
29	1347
30	243
31	30
32	9
33	11556
34	12552
35	2412
36	366
37	48
38	17073
39	19266
40	3969
41	804
42	60
43	3
44	0
45	3
46	0
47	1
48	24786
49	27672
50	6954
51	1206
52	186
53	34611
54	39066
55	9099
56	1768
57	198
58	27

[1, 12, 75, 24, 3, 258, 132, 6, 621, 525, 33, 19, 1308, 1272, 144, 24, 2505, 2628, 345, 61, 4434, 4734, 984, 102, 12, 6, 7365, 7992, 1347, 243, 30, 9, 11556, 12552, 2412, 366, 48, 17073, 19266, 3969, 804, 60, 3, 0, 3, 0, 1, 24786, 27672, 6954, 1206, 186, 34611, 39066, 9099, 1768, 198, 27]

cp's OEIS Frontend

A346446 Irregular triangle read by rows: T(n,k) = number of k-sided polygons formed when connecting infinite lines between all vertices and all points that divide the sides of an equilateral triangle into n equal parts, for k = 3, 4, ..., max_k.

Table of values

List of values