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.

A082660 Number of ways n can be expressed as the sum of a square and a triangular number.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 2, 0, 0, 3, 1, 1, 0, 1, 2, 1, 1, 0, 3, 0, 1, 2, 0, 1, 1, 2, 0, 2, 1, 1, 2, 1, 0, 0, 1, 1, 4, 0, 1, 2, 0, 1, 0, 1, 2, 3, 0, 0, 1, 1, 1, 2, 1, 1, 2, 1, 1, 0, 2, 0, 2, 0, 0, 3, 1, 1, 2, 0, 0, 4, 1, 1, 0, 1, 1, 0, 1, 1, 2, 1, 1, 3, 0, 1, 2, 0, 2, 0, 0, 0, 4, 2, 0, 2, 1, 1, 0, 0, 0, 2, 1, 2, 2, 1, 1]