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.

A307597 Number of partitions of n into 2 distinct positive triangular numbers.

Table of values

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

List of values

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