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.

A335250 Numbers m such that twice the number of unordered Goldbach partitions of 2m equals the number of unordered Goldbach partitions of 4m.

Table of values

n a(n)
1 1
2 4
3 9
4 15
5 21
6 30
7 40
8 46
9 69
10 70
11 79
12 81
13 82
14 106
15 114
16 199
17 229
18 256
19 361
20 391
21 469
22 586
23 754
24 760
25 766
26 826
27 892
28 1471
29 1483
30 1525
31 1591
32 1609
33 1624
34 1816
35 2194
36 2206
37 2454
38 2629
39 2869
40 3955
41 3961
42 3964
43 6406
44 6946
45 11749

List of values

[1, 4, 9, 15, 21, 30, 40, 46, 69, 70, 79, 81, 82, 106, 114, 199, 229, 256, 361, 391, 469, 586, 754, 760, 766, 826, 892, 1471, 1483, 1525, 1591, 1609, 1624, 1816, 2194, 2206, 2454, 2629, 2869, 3955, 3961, 3964, 6406, 6946, 11749]