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.

A118653 Least number of squares that add up to the partition number A000041(n).

Table of values

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

List of values

[1, 1, 2, 3, 2, 4, 3, 4, 3, 3, 3, 3, 3, 2, 4, 3, 4, 3, 3, 2, 3, 3, 3, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 2, 3, 4, 3, 3, 4, 3, 3, 4, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 4, 3, 3, 3, 2, 2, 4, 2, 3, 3, 4, 3, 4, 3, 3, 4, 3, 2, 4, 4, 4, 3, 3, 2, 3, 3, 3, 2, 2, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3]