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.

A237638 a(n) is the number of prime sets such that each set contains enough prime numbers to decompose every even number from 6 to 2n into the sum of two of its elements (reuse allowed), while none of the sets is a subset of another such set.

Table of values

n a(n)
3 1
4 1
5 1
6 1
7 1
8 2
9 2
10 3
11 4
12 4
13 5
14 6
15 6
16 9
17 11
18 11
19 11
20 13
21 16
22 23
23 25
24 31
25 47
26 57
27 63
28 70
29 74
30 79
31 82
32 122
33 131
34 129
35 180
36 215
37 219
38 323
39 367
40 446
41 501
42 531
43 661
44 867
45 897
46 1311
47 1471
48 1691
49 1695
50 2130
51 2288
52 2833
53 3363
54 3891
55 5435
56 8068
57 8867
58 13476
59 15451
60 15897

List of values

[1, 1, 1, 1, 1, 2, 2, 3, 4, 4, 5, 6, 6, 9, 11, 11, 11, 13, 16, 23, 25, 31, 47, 57, 63, 70, 74, 79, 82, 122, 131, 129, 180, 215, 219, 323, 367, 446, 501, 531, 661, 867, 897, 1311, 1471, 1691, 1695, 2130, 2288, 2833, 3363, 3891, 5435, 8068, 8867, 13476, 15451, 15897]