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.

A230443 Number of decompositions of 2n into a sum of two primes p2 >= p1 such that the number of runs in binary expansion of p2-p1 is less than or equal to 4.

Table of values

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

List of values

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