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.

A168339 a(n) is the least number of squares needed to form n edge-disjoint 1 X 1 holes inside a rectangle of squares with a solid border.

Table of values

n a(n)
1 8
2 13
3 17
4 20
5 20
6 24
7 28
8 27
9 31
10 32
11 34
12 36
13 36
14 40
15 41
16 44
17 46
18 45
19 51
20 50
21 51
22 55
23 54
24 56
25 56
26 62
27 61
28 62
29 67
30 66
31 68
32 67
33 71
34 74
35 73
36 74
37 80
38 79
39 78
40 80
41 80
42 84
43 87
44 86
45 87
46 89
47 93
48 92
49 94
50 93
51 99
52 98
53 100
54 100
55 101
56 104
57 108
58 107
59 106
60 108
61 108
62 114
63 113
64 116
65 115
66 116

List of values

[8, 13, 17, 20, 20, 24, 28, 27, 31, 32, 34, 36, 36, 40, 41, 44, 46, 45, 51, 50, 51, 55, 54, 56, 56, 62, 61, 62, 67, 66, 68, 67, 71, 74, 73, 74, 80, 79, 78, 80, 80, 84, 87, 86, 87, 89, 93, 92, 94, 93, 99, 98, 100, 100, 101, 104, 108, 107, 106, 108, 108, 114, 113, 116, 115, 116]