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.

A257474 Number of unordered ways to write n = a + b, where a and b are distinct elements of the set {floor(x/3): 3*x-1 and 3*x+1 are twin prime}, one of a and b is even, and one of a and b has the form p-1 or p-2 with p prime.

Table of values

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

List of values

[1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 3, 2, 3, 3, 3, 3, 5, 3, 3, 3, 5, 3, 3, 3, 5, 3, 4, 3, 3, 3, 6, 5, 1, 2, 5, 4, 2, 1, 2, 3, 4, 3, 4, 5, 3, 3, 3, 3, 3, 2, 2, 2, 4, 3, 3, 2, 3, 3, 1, 3, 4, 4, 5, 4, 4, 3, 4, 3, 3, 1, 5, 3, 5, 3, 2, 1, 3, 3, 3, 1, 2, 2, 4, 2, 4, 4, 5, 3, 4, 4, 5, 3, 3, 2]