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.

A255191 Number of solutions to the equation n = x^2 + y*(y+1)/2 + z*(z+1)/2 (x,y,z=0,1,...) with x == Floor[sqrt(n)] (mod 2) and y <= z.

Table of values

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

List of values

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