A344938 - cp's OEIS frontend

A344938 Irregular triangle read by rows: T(n,k) = number of k-sided polygons formed when every pair of vertices of a regular n-gon are joined by an infinite line, for k = 3, 4, ..., max_k.

n	a(n)
3	1
4	4
5	15
6	0
7	1
8	36
9	6
10	70
11	21
12	7
13	0
14	1
15	112
16	64
17	189
18	108
19	36
20	18
21	0
22	0
23	1
24	270
25	220
26	50
27	407
28	352
29	110
30	55
31	0
32	0
33	0
34	0
35	1
36	624
37	528
38	884
39	689
40	325
41	91
42	0
43	26
44	0
45	0
46	0
47	0
48	1
49	1162
50	1092
51	266
52	14
53	1530
54	1545
55	480
56	270
57	45
58	0
59	0
60	0
61	0
62	0
63	0
64	0
65	1
66	2080
67	2032
68	416
69	80

[1, 4, 15, 0, 1, 36, 6, 70, 21, 7, 0, 1, 112, 64, 189, 108, 36, 18, 0, 0, 1, 270, 220, 50, 407, 352, 110, 55, 0, 0, 0, 0, 1, 624, 528, 884, 689, 325, 91, 0, 26, 0, 0, 0, 0, 1, 1162, 1092, 266, 14, 1530, 1545, 480, 270, 45, 0, 0, 0, 0, 0, 0, 0, 1, 2080, 2032, 416, 80]

cp's OEIS Frontend

A344938 Irregular triangle read by rows: T(n,k) = number of k-sided polygons formed when every pair of vertices of a regular n-gon are joined by an infinite line, for k = 3, 4, ..., max_k.

Table of values

List of values