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.

A307598 Number of partitions of n into 3 distinct positive triangular numbers.

Table of values

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

List of values

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