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.

A112604 Number of representations of n as a sum of three times a square and two times a triangular number.

Table of values

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

List of values

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