cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A367665 Irregular table read by rows: T(n,k) is the number of k-sided polygons, for n>=1 and k>=3, in a hexagon when straight line segments connect the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on the edge on the opposite side of the hexagon.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 0
6 6
7 30
8 12
9 12
10 126
11 102
12 6
13 18
14 384
15 294
16 78
17 18
18 0
19 6
20 888
21 726
22 300
23 42
24 12
25 1824
26 1500
27 594
28 216
29 12
30 3186
31 3048
32 1206
33 186
34 36
35 5592
36 4914
37 1866
38 588
39 48
40 6
41 8736
42 8298
43 3108
44 816
45 108
46 12
47 13164
48 12786
49 5046
50 1368
51 180
52 18
53 19578
54 17940
55 7242
56 1854
57 144
58 60
59 26700
60 27426
61 10842
62 2652
63 324
64 18

List of values

[0, 0, 0, 1, 0, 6, 30, 12, 12, 126, 102, 6, 18, 384, 294, 78, 18, 0, 6, 888, 726, 300, 42, 12, 1824, 1500, 594, 216, 12, 3186, 3048, 1206, 186, 36, 5592, 4914, 1866, 588, 48, 6, 8736, 8298, 3108, 816, 108, 12, 13164, 12786, 5046, 1368, 180, 18, 19578, 17940, 7242, 1854, 144, 60, 26700, 27426, 10842, 2652, 324, 18]