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.

A381014 If n = Product (p_j^k_j) then a(n) = Sum partition(p_j^k_j).

Table of values

n a(n)
1 0
2 2
3 3
4 5
5 7
6 5
7 15
8 22
9 30
10 9
11 56
12 8
13 101
14 17
15 10
16 231
17 297
18 32
19 490
20 12
21 18
22 58
23 1255
24 25
25 1958
26 103
27 3010
28 20
29 4565
30 12
31 6842
32 8349
33 59
34 299
35 22
36 35
37 21637
38 492
39 104
40 29
41 44583
42 20
43 63261
44 61
45 37
46 1257
47 124754
48 234
49 173525
50 1960
51 300
52 106
53 329931
54 3012
55 63
56 37
57 493
58 4567
59 831820
60 15

List of values

[0, 2, 3, 5, 7, 5, 15, 22, 30, 9, 56, 8, 101, 17, 10, 231, 297, 32, 490, 12, 18, 58, 1255, 25, 1958, 103, 3010, 20, 4565, 12, 6842, 8349, 59, 299, 22, 35, 21637, 492, 104, 29, 44583, 20, 63261, 61, 37, 1257, 124754, 234, 173525, 1960, 300, 106, 329931, 3012, 63, 37, 493, 4567, 831820, 15]