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.

A279317 Minimal number of squares in a dissection of an (n) X (n+1) oblong into squares.

Table of values

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

List of values

[2, 3, 4, 5, 5, 5, 7, 7, 6, 6, 7, 7, 7, 7, 7, 8, 8, 7, 9, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 8, 9, 9, 9, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 9, 9, 10, 9, 10, 9, 10, 10, 10, 10, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 10, 10, 10, 10, 10, 10, 10, 11, 11, 10, 10, 10, 10, 10, 10, 11, 10, 11, 10, 11, 10, 11, 11, 11, 11, 10, 11, 11, 11, 11, 11, 11, 11, 11, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12]