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.

A369461 Number of representations of 12n-5 as a sum (p*q + p*r + q*r) with three odd primes p <= q <= r.

Table of values

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

List of values

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