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.

A321028 a(n) = 6 + round(n^3) - (minimal number of squares in a dissection of an (n) X (n+1) oblong into squares).

Table of values

n a(n)
1 5
2 4
3 3
4 3
5 3
6 3
7 1
8 1
9 2
10 2
11 1
12 1
13 1
14 1
15 1
16 1
17 1
18 2
19 0
20 1
21 1
22 1
23 1
24 1
25 1
26 1
27 1
28 0
29 0
30 1
31 0
32 0
33 0
34 1
35 0
36 0
37 0
38 0
39 0
40 0
41 0
42 0
43 1
44 0
45 1
46 1
47 0
48 1
49 0
50 1
51 0
52 0
53 0
54 0
55 1
56 0
57 0
58 0
59 0
60 0
61 0
62 0
63 0
64 0
65 0
66 0
67 0
68 0
69 -1
70 0
71 0
72 0
73 0
74 0
75 0
76 0
77 -1
78 -1
79 0
80 0
81 0
82 0
83 0
84 0
85 -1
86 0
87 -1
88 0
89 -1
90 0
91 -1
92 0
93 0
94 0
95 1
96 0
97 0
98 0
99 0
100 0
101 0
102 0
103 0
104 1
105 0
106 0
107 0
108 0
109 0
110 0
111 0
112 0
113 -1
114 0
115 0
116 0
117 0
118 0
119 0
120 0
121 0
122 0
123 0
124 0
125 0

List of values

[5, 4, 3, 3, 3, 3, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, -1, -1, 0, 0, 0, 0, 0, 0, -1, 0, -1, 0, -1, 0, -1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]