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.

A355992 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 four corner vertices to the points dividing the sides into n equal parts.

Table of values

n a(n)
1 4
2 24
3 8
4 56
5 28
6 12
7 96
8 80
9 8
10 4
11 144
12 140
13 36
14 12
15 216
16 216
17 24
18 4
19 272
20 332
21 76
22 24
23 8
24 360
25 448
26 80
27 28
28 456
29 572
30 132
31 36
32 8
33 568
34 728
35 128
36 64
37 656
38 916
39 260
40 28
41 40
42 4
43 792
44 1104
45 176
46 36
47 928
48 1308
49 316
50 128
51 32
52 4
53 1064
54 1568
55 304
56 128
57 16
58 1240
59 1772
60 396
61 88
62 32
63 4
64 1416
65 2032
66 432
67 156
68 32

List of values

[4, 24, 8, 56, 28, 12, 96, 80, 8, 4, 144, 140, 36, 12, 216, 216, 24, 4, 272, 332, 76, 24, 8, 360, 448, 80, 28, 456, 572, 132, 36, 8, 568, 728, 128, 64, 656, 916, 260, 28, 40, 4, 792, 1104, 176, 36, 928, 1308, 316, 128, 32, 4, 1064, 1568, 304, 128, 16, 1240, 1772, 396, 88, 32, 4, 1416, 2032, 432, 156, 32]