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.

A309332 Number of ways the n-th triangular number T(n) = A000217(n) can be written as the sum of two positive triangular numbers.

Table of values

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

List of values

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