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.

A355801 Irregular table read by rows: T(n,k) is the number of k-sided polygons, for k>=3, in a square 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 square.

Table of values

n a(n)
1 0
2 1
3 0
4 4
5 12
6 12
7 56
8 32
9 16
10 156
11 124
12 24
13 8
14 0
15 4
16 384
17 228
18 72
19 28
20 716
21 648
22 144
23 68
24 8
25 4
26 1312
27 1144
28 240
29 112
30 8
31 2244
32 1912
33 528
34 256
35 3528
36 3072
37 696
38 360
39 16
40 5012
41 5536
42 1296
43 524
44 48
45 28
46 7696
47 6596
48 1960
49 572
50 16
51 10340
52 11448
53 2968
54 1028
55 160
56 24
57 14520
58 14428
59 3872
60 1156
61 104
62 8

List of values

[0, 1, 0, 4, 12, 12, 56, 32, 16, 156, 124, 24, 8, 0, 4, 384, 228, 72, 28, 716, 648, 144, 68, 8, 4, 1312, 1144, 240, 112, 8, 2244, 1912, 528, 256, 3528, 3072, 696, 360, 16, 5012, 5536, 1296, 524, 48, 28, 7696, 6596, 1960, 572, 16, 10340, 11448, 2968, 1028, 160, 24, 14520, 14428, 3872, 1156, 104, 8]