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.

A112607 Number of representations of n as a sum of a triangular number and twelve times a triangular number.

Table of values

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

List of values

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