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.

A260740 a(n) = n minus the number of positive squares needed to sum to n using the greedy algorithm: a(n) = n - A053610(n).

Table of values

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

List of values

[0, 0, 0, 0, 3, 3, 3, 3, 6, 8, 8, 8, 8, 11, 11, 11, 15, 15, 15, 15, 18, 18, 18, 18, 21, 24, 24, 24, 24, 27, 27, 27, 27, 30, 32, 32, 35, 35, 35, 35, 38, 38, 38, 38, 41, 43, 43, 43, 43, 48, 48, 48, 48, 51, 51, 51, 51, 54, 56, 56, 56, 56, 59, 59, 63, 63, 63, 63, 66, 66, 66, 66, 69, 71, 71, 71, 71, 74, 74, 74, 78, 80]