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.

A372734 Irregular table read by rows: T(n,k) is the number of k-gons, k>=2, among all distinct circles that can be constructed from the 3 vertices and the equally spaced 3*n points placed on the sides of an equilateral triangle when every pair of the 3 + 3*n points are connected by a circle and where the points lie at the ends of the circle's diameter.

Table of values

n a(n)
0 0
1 7
2 12
3 61
4 9
5 6
6 6
7 303
8 108
9 9
10 9
11 3
12 18
13 771
14 603
15 150
16 15
17 9
18 0
19 1
20 24
21 1722
22 1740
23 339
24 81
25 3
26 0
27 1
28 30
29 3789
30 4326
31 1104
32 234
33 18
34 3
35 36
36 6907
37 8274
38 2193
39 432
40 45
41 18
42 66
43 12012
44 15504
45 4173
46 922
47 105
48 45
49 3
50 3
51 90
52 19860
53 24774
54 7389
55 1773
56 150
57 30
58 48
59 30594
60 39852
61 12438
62 2998
63 387
64 48

List of values

[0, 7, 12, 61, 9, 6, 6, 303, 108, 9, 9, 3, 18, 771, 603, 150, 15, 9, 0, 1, 24, 1722, 1740, 339, 81, 3, 0, 1, 30, 3789, 4326, 1104, 234, 18, 3, 36, 6907, 8274, 2193, 432, 45, 18, 66, 12012, 15504, 4173, 922, 105, 45, 3, 3, 90, 19860, 24774, 7389, 1773, 150, 30, 48, 30594, 39852, 12438, 2998, 387, 48]