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.

A230596 Number of ways to write n = x + y + z with 0 < x <= y <= z such that x*y*z is a triangular number, and that x is a triangular number of the form (p^2 - 1)/8 with p an odd prime.

Table of values

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

List of values

[0, 0, 1, 0, 1, 1, 0, 2, 1, 1, 2, 2, 1, 1, 2, 2, 4, 1, 1, 2, 3, 2, 5, 1, 3, 3, 3, 3, 2, 8, 1, 4, 2, 2, 3, 5, 1, 3, 6, 3, 5, 3, 1, 6, 4, 5, 3, 3, 1, 6, 6, 3, 4, 2, 4, 3, 8, 3, 3, 8, 5, 2, 4, 4, 6, 6, 3, 6, 2, 3, 12, 7, 1, 10, 7, 3, 4, 5, 3, 7, 8, 2, 5, 4, 6, 4, 2, 5, 6, 6, 4, 4, 13, 6, 9, 6, 4, 10, 7, 4]