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.

A373109 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 4 vertices and the equally spaced 4*n points placed on the sides of a square when every pair of the 4 + 4*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 8
1 4
2 40
3 76
4 20
5 60
6 492
7 304
8 56
9 20
10 88
11 1696
12 1136
13 252
14 64
15 16
16 124
17 4196
18 3536
19 1052
20 204
21 28
22 4
23 128
24 8940
25 7948
26 2448
27 496
28 68
29 0
30 4
31 172
32 16464
33 17628
34 5560
35 1268
36 164
37 4
38 144
39 28424
40 30884
41 9964
42 2064
43 312
44 24
45 8
46 0
47 8
48 196
49 46844
50 51840
51 17832
52 4112
53 556
54 60
55 20

List of values

[8, 4, 40, 76, 20, 60, 492, 304, 56, 20, 88, 1696, 1136, 252, 64, 16, 124, 4196, 3536, 1052, 204, 28, 4, 128, 8940, 7948, 2448, 496, 68, 0, 4, 172, 16464, 17628, 5560, 1268, 164, 4, 144, 28424, 30884, 9964, 2064, 312, 24, 8, 0, 8, 196, 46844, 51840, 17832, 4112, 556, 60, 20]