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.

A100951 Number of ways to write n = p*q + r with three distinct primes p, q and r.

Table of values

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

List of values

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