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.

A210533 Number of ways to write 2n = x+y (x,y>0) with x-1 and x+1 both prime, and x and x^3+y^3 both practical.

Table of values

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

List of values

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