A330914 - cp's OEIS frontend

A330914 Irregular table read by rows: Take a semicircular polygon with all vertices mutually connected by straight line segments, as in A333642. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.

n	a(n)
1	2
2	7
3	1
4	16
5	4
6	30
7	10
8	3
9	52
10	20
11	8
12	79
13	47
14	10
15	3
16	116
17	86
18	18
19	4
20	168
21	145
22	9
23	2
24	234
25	212
26	52
27	12
28	319
29	312
30	80
31	17
32	2
33	430
34	446
35	96
36	18
37	2
38	551
39	616
40	173
41	28
42	5
43	730
44	792
45	248
46	44
47	6
48	960
49	1035
50	167
51	25
52	1148
53	1384
54	422
55	66
56	20

[2, 7, 1, 16, 4, 30, 10, 3, 52, 20, 8, 79, 47, 10, 3, 116, 86, 18, 4, 168, 145, 9, 2, 234, 212, 52, 12, 319, 312, 80, 17, 2, 430, 446, 96, 18, 2, 551, 616, 173, 28, 5, 730, 792, 248, 44, 6, 960, 1035, 167, 25, 1148, 1384, 422, 66, 20]

cp's OEIS Frontend

A330914 Irregular table read by rows: Take a semicircular polygon with all vertices mutually connected by straight line segments, as in A333642. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.

Table of values

List of values