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.

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

Table of values

n a(n)
1 4
2 40
3 128
4 44
5 12
6 320
7 152
8 24
9 616
10 512
11 84
12 28
13 1240
14 744
15 120
16 40
17 1936
18 1928
19 372
20 136
21 8
22 3288
23 2656
24 616
25 160
26 4960
27 4500
28 1020
29 332
30 48
31 7224
32 6472
33 1424
34 392
35 16
36 9760
37 11064
38 2564
39 824
40 72
41 16
42 14144
43 12424
44 2696
45 856
46 32
47 18312
48 20604
49 5308
50 1468
51 328
52 16
53 24384
54 25392
55 5968
56 1584
57 160
58 8

List of values

[4, 40, 128, 44, 12, 320, 152, 24, 616, 512, 84, 28, 1240, 744, 120, 40, 1936, 1928, 372, 136, 8, 3288, 2656, 616, 160, 4960, 4500, 1020, 332, 48, 7224, 6472, 1424, 392, 16, 9760, 11064, 2564, 824, 72, 16, 14144, 12424, 2696, 856, 32, 18312, 20604, 5308, 1468, 328, 16, 24384, 25392, 5968, 1584, 160, 8]