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.

A231071 Number of solutions to n = +- 1^2 +- 2^2 +- 3^2 +- 4^2 +- ... +- k^2 for minimal k giving at least one solution.

Table of values

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

List of values

[2, 1, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 2, 3, 2, 2, 2, 1, 1, 2, 1, 2, 1, 2, 1, 9, 1, 3, 1, 1, 1, 2, 1, 1, 6, 1, 1, 1, 1, 1, 2, 1, 5, 1, 1, 1, 1, 4, 3, 1, 2, 1, 2, 2, 1, 2, 1, 14, 2, 1, 3, 2, 1, 2, 1, 1, 7, 1, 3, 2, 5, 1, 2, 1]