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.

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

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 1
5 3
6 2
7 6
8 4
9 8
10 7
11 16
12 6
13 24
14 17
15 24
16 20
17 46
18 22
19 62
20 31
21 63
22 57
23 106
24 35
25 122
26 90
27 137
28 88
29 212
30 74
31 262
32 134
33 267
34 206
35 345
36 121
37 476
38 294
39 484
40 232
41 698
42 242
43 837
44 389
45 763
46 571
47 1185
48 318
49 1327
50 634
51 1392
52 727
53 1927
54 640
55 2056
56 827
57 2233
58 1328

List of values

[0, 0, 0, 1, 1, 3, 2, 6, 4, 8, 7, 16, 6, 24, 17, 24, 20, 46, 22, 62, 31, 63, 57, 106, 35, 122, 90, 137, 88, 212, 74, 262, 134, 267, 206, 345, 121, 476, 294, 484, 232, 698, 242, 837, 389, 763, 571, 1185, 318, 1327, 634, 1392, 727, 1927, 640, 2056, 827, 2233, 1328]