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.

A333259 a(n) = Sum_{p in L(n)} 2^(pi(p) - 1) where L(n) is the set of all least primes in partitions of n into prime parts.

Table of values

n a(n)
0 0
1 0
2 1
3 2
4 1
5 5
6 3
7 9
8 3
9 3
10 7
11 19
12 7
13 35
14 11
15 7
16 7
17 71
18 15
19 135
20 15
21 15
22 23
23 263
24 31
25 15
26 47
27 15
28 31
29 527
30 63
31 1039
32 47
33 31
34 95
35 31
36 111
37 2079
38 143
39 63
40 95
41 4127
42 191
43 8255
44 63
45 63
46 351
47 16447
48 223
49 63
50 191
51 127
52 319
53 32895
54 383
55 127
56 191
57 255
58 639
59 65663

List of values

[0, 0, 1, 2, 1, 5, 3, 9, 3, 3, 7, 19, 7, 35, 11, 7, 7, 71, 15, 135, 15, 15, 23, 263, 31, 15, 47, 15, 31, 527, 63, 1039, 47, 31, 95, 31, 111, 2079, 143, 63, 95, 4127, 191, 8255, 63, 63, 351, 16447, 223, 63, 191, 127, 319, 32895, 383, 127, 191, 255, 639, 65663]