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.

A209063 Let p = A099180(n) be the n-th prime which is greater than its reversal p'; a(n) = number of ways to write p as a multiple of p' +- q where q is a prime < p.

Table of values

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

List of values

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