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.

A325142 a(n) = k if (n - k, n + k) is the centered Goldbach partition of 2n if it exists and -1 otherwise.

Table of values

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

List of values

[-1, -1, 0, 0, 1, 0, 1, 0, 3, 2, 3, 0, 1, 0, 3, 2, 3, 0, 1, 0, 3, 2, 9, 0, 5, 6, 3, 4, 9, 0, 1, 0, 9, 4, 3, 6, 5, 0, 9, 2, 3, 0, 1, 0, 3, 2, 15, 0, 5, 12, 3, 8, 9, 0, 7, 12, 3, 4, 15, 0, 1, 0, 9, 4, 3, 6, 5, 0, 15, 2, 3, 0, 1, 0, 15, 4, 3, 6, 5, 0, 9, 2, 15, 0]