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.

A210722 Number of ways to write n = (2-(n mod 2))p+q+2^k with p, q-1, q+1 all prime, and p-1, p+1, q all practical.

Table of values

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

List of values

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