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.

A053610 Number of positive squares needed to sum to n using the greedy algorithm.

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

List of values

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