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.

A385675 For positive integers n, a multiset A of positive integers is called "n-good" if for any number 1 <= i <= n, we can find a submultiset B of A such that the sum of B is equal to i. a(n) is the number of minimal n-good multisets.

Table of values

n a(n)
1 1
2 2
3 3
4 7
5 9
6 18
7 27
8 47
9 62
10 101
11 140
12 226
13 301
14 437
15 579
16 838
17 1077
18 1525
19 1985
20 2721
21 3470
22 4674
23 5899
24 7843
25 9773
26 12703
27 15803
28 20431
29 25129
30 32167
31 39519
32 49982
33 60928
34 76373
35 92537
36 115313
37 138969
38 171372
39 205847
40 252604
41 301444
42 367890
43 438145
44 531202
45 630209

List of values

[1, 2, 3, 7, 9, 18, 27, 47, 62, 101, 140, 226, 301, 437, 579, 838, 1077, 1525, 1985, 2721, 3470, 4674, 5899, 7843, 9773, 12703, 15803, 20431, 25129, 32167, 39519, 49982, 60928, 76373, 92537, 115313, 138969, 171372, 205847, 252604, 301444, 367890, 438145, 531202, 630209]