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.

A319913 Number of distinct integer partitions whose parts can be combined together using additions and multiplications to obtain n, with the exception that 1's can only be added and not multiplied with other parts.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 7
6 16
7 20
8 37
9 53
10 81
11 107
12 177
13 227
14 332
15 449
16 647
17 830
18 1162
19 1480
20 2032
21 2597
22 3447
23 4348
24 5775
25 7251
26 9374
27 11758
28 15026
29 18640
30 23688
31 29220
32 36771
33 45128
34 56168
35 68674
36 85015
37 103394
38 126923
39 153871
40 187911
41 226653

List of values

[1, 2, 3, 5, 7, 16, 20, 37, 53, 81, 107, 177, 227, 332, 449, 647, 830, 1162, 1480, 2032, 2597, 3447, 4348, 5775, 7251, 9374, 11758, 15026, 18640, 23688, 29220, 36771, 45128, 56168, 68674, 85015, 103394, 126923, 153871, 187911, 226653]