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.

A365072 Number of integer partitions of n such that no distinct part can be written as a (strictly) positive linear combination of the other distinct parts.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 3
5 3
6 4
7 5
8 6
9 8
10 9
11 17
12 15
13 31
14 34
15 53
16 65
17 109
18 117
19 196
20 224
21 328
22 405
23 586
24 673
25 968
26 1163
27 1555
28 1889
29 2531
30 2986
31 3969
32 4744
33 6073
34 7333
35 9317
36 11053
37 14011
38 16710
39 20702
40 24714
41 30549
42 36127
43 44413
44 52561
45 63786
46 75583
47 91377
48 107436
49 129463

List of values

[1, 1, 2, 2, 3, 3, 4, 5, 6, 8, 9, 17, 15, 31, 34, 53, 65, 109, 117, 196, 224, 328, 405, 586, 673, 968, 1163, 1555, 1889, 2531, 2986, 3969, 4744, 6073, 7333, 9317, 11053, 14011, 16710, 20702, 24714, 30549, 36127, 44413, 52561, 63786, 75583, 91377, 107436, 129463]