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.

A327479 a(n) is the minimum number of squares of unit area that must be removed from an n X n square to obtain a connected figure without holes and of the longest perimeter.

Table of values

n a(n)
0 0
1 0
2 0
3 4
4 6
5 12
6 16
7 28
8 32
9 44
10 52
11 68
12 76
13 92
14 104
15 124
16 136
17 156
18 172
19 196
20 212
21 236
22 256
23 284
24 304
25 332
26 356
27 388
28 412
29 444
30 472
31 508
32 536
33 572
34 604
35 644
36 676
37 716
38 752
39 796
40 832
41 876
42 916
43 964
44 1004
45 1052
46 1096
47 1148
48 1192
49 1244
50 1292
51 1348
52 1396
53 1452
54 1504

List of values

[0, 0, 0, 4, 6, 12, 16, 28, 32, 44, 52, 68, 76, 92, 104, 124, 136, 156, 172, 196, 212, 236, 256, 284, 304, 332, 356, 388, 412, 444, 472, 508, 536, 572, 604, 644, 676, 716, 752, 796, 832, 876, 916, 964, 1004, 1052, 1096, 1148, 1192, 1244, 1292, 1348, 1396, 1452, 1504]