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.

A057768 From Goldbach problem: number of decompositions of 2n-1 into sum of a prime lucky number(from A031157) and a twin even-lucky-number(from A045955, A045956).

Table of values

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

List of values

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