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.

A254610 Number of decompositions of 2n into sums of two primes p1 <= p2 such that the smallest |k*p1-p2| = 2^m+b, where |b|<=2.

Table of values

n a(n)
1 0
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 3
27 5
28 3
29 4
30 6
31 3
32 5
33 6
34 2
35 4
36 6
37 4
38 4
39 7
40 4
41 5
42 8
43 5
44 4
45 9
46 4
47 4
48 7
49 2
50 5
51 7
52 4
53 5
54 8
55 5
56 6
57 9
58 5
59 5
60 11
61 4
62 5
63 8
64 3
65 5
66 7
67 5
68 4
69 7
70 6
71 6
72 8
73 5
74 4
75 9
76 3
77 6
78 8
79 4
80 7
81 9
82 4
83 5
84 11
85 7
86 5
87 8

List of values

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