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.

A157187 Number of ways to write n as p*q-(p+q) with primes p <= q.

Table of values

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

List of values

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