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.

A350698 Consider the positive squares summing to n as obtained by the greedy algorithm; a(n) is the least of these squares.

Table of values

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

List of values

[1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 1, 1, 4, 1, 1, 16, 1, 1, 1, 4, 1, 1, 1, 4, 25, 1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 36, 1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 1, 1, 49, 1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 1, 1, 4, 1, 64, 1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 1, 1, 4, 1, 1, 16, 81, 1, 1, 1]