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.

A365006 Number of strict integer partitions of n such that no part can be written as a (strictly) positive linear combination of the others.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 2
6 1
7 3
8 2
9 4
10 4
11 8
12 4
13 11
14 9
15 16
16 14
17 25
18 20
19 37
20 31
21 49
22 47
23 73
24 64
25 101
26 96
27 135
28 133
29 190
30 181
31 256
32 253
33 336
34 342
35 453
36 452
37 596
38 609
39 771
40 803
41 1014
42 1041
43 1309
44 1362
45 1674
46 1760
47 2151
48 2249
49 2736
50 2884
51 3449
52 3661
53 4366
54 4615
55 5486
56 5825

List of values

[1, 1, 1, 1, 1, 2, 1, 3, 2, 4, 4, 8, 4, 11, 9, 16, 14, 25, 20, 37, 31, 49, 47, 73, 64, 101, 96, 135, 133, 190, 181, 256, 253, 336, 342, 453, 452, 596, 609, 771, 803, 1014, 1041, 1309, 1362, 1674, 1760, 2151, 2249, 2736, 2884, 3449, 3661, 4366, 4615, 5486, 5825]