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.

A365378 Number of integer partitions with sum < n whose distinct parts 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 4
6 2
7 9
8 5
9 13
10 10
11 28
12 7
13 45
14 25
15 51
16 32
17 101
18 31
19 148
20 50
21 166
22 106
23 291
24 47
25 374
26 176
27 450
28 179
29 721
30 121
31 963
32 285
33 1080
34 474
35 1534
36 200
37 2140
38 712
39 2407
40 599
41 3539
42 481
43 4546
44 1014
45 4885

List of values

[0, 0, 0, 1, 1, 4, 2, 9, 5, 13, 10, 28, 7, 45, 25, 51, 32, 101, 31, 148, 50, 166, 106, 291, 47, 374, 176, 450, 179, 721, 121, 963, 285, 1080, 474, 1534, 200, 2140, 712, 2407, 599, 3539, 481, 4546, 1014, 4885]