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.

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

Table of values

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

List of values

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