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.

A087187 Number of ways to write n = i*p + j*q, where (p,q) is a twin prime pair and i,j>0.

Table of values

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

List of values

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