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.

A365311 Number of strict integer partitions with sum <= n that can be linearly combined using nonnegative coefficients to obtain n.

Table of values

n a(n)
0 0
1 1
2 2
3 3
4 5
5 6
6 11
7 12
8 20
9 24
10 35
11 38
12 63
13 63
14 92
15 112
16 148
17 160
18 230
19 244
20 339
21 383
22 478
23 533
24 726
25 781
26 978
27 1123
28 1394
29 1526
30 1960
31 2112
32 2630
33 2945
34 3518
35 3964
36 4856
37 5261
38 6307
39 7099
40 8464
41 9258
42 11140
43 12155
44 14419
45 16093
46 18589
47 20565
48 24342
49 26597
50 30948

List of values

[0, 1, 2, 3, 5, 6, 11, 12, 20, 24, 35, 38, 63, 63, 92, 112, 148, 160, 230, 244, 339, 383, 478, 533, 726, 781, 978, 1123, 1394, 1526, 1960, 2112, 2630, 2945, 3518, 3964, 4856, 5261, 6307, 7099, 8464, 9258, 11140, 12155, 14419, 16093, 18589, 20565, 24342, 26597, 30948]