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.

A191091 Least number of squares required when writing n as a sum of squares with the smallest square as large as possible.

Table of values

n a(n)
1 1
2 2
3 3
4 1
5 2
6 3
7 4
8 2
9 1
10 2
11 3
12 3
13 2
14 3
15 4
16 1
17 3
18 2
19 3
20 2
21 4
22 3
23 4
24 3
25 1
26 4
27 3
28 4
29 2
30 5
31 4
32 2
33 3
34 2
35 5
36 1
37 4
38 3
39 6
40 2
41 2
42 4
43 3
44 3
45 2
46 5
47 4
48 3
49 1
50 2
51 5
52 2
53 2
54 3
55 6
56 3
57 3
58 2
59 3
60 4
61 2
62 3
63 4
64 1
65 2
66 3
67 3
68 3
69 3
70 3
71 4
72 2
73 4
74 2
75 3
76 4
77 3
78 3
79 4
80 2
81 1
82 4
83 3
84 4
85 2
86 3
87 4

List of values

[1, 2, 3, 1, 2, 3, 4, 2, 1, 2, 3, 3, 2, 3, 4, 1, 3, 2, 3, 2, 4, 3, 4, 3, 1, 4, 3, 4, 2, 5, 4, 2, 3, 2, 5, 1, 4, 3, 6, 2, 2, 4, 3, 3, 2, 5, 4, 3, 1, 2, 5, 2, 2, 3, 6, 3, 3, 2, 3, 4, 2, 3, 4, 1, 2, 3, 3, 3, 3, 3, 4, 2, 4, 2, 3, 4, 3, 3, 4, 2, 1, 4, 3, 4, 2, 3, 4]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.