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.

A365379 Number of integer partitions with sum <= n whose distinct parts can be linearly combined using nonnegative coefficients to obtain n.

Table of values

n a(n)
0 0
1 1
2 3
3 5
4 10
5 14
6 27
7 35
8 61
9 83
10 128
11 166
12 264
13 327
14 482
15 632
16 882
17 1110
18 1565
19 1938
20 2663
21 3339
22 4401
23 5471
24 7290
25 8921
26 11555
27 14291
28 18280
29 22303
30 28507
31 34507
32 43534
33 52882
34 65798
35 79621
36 98932
37 118629
38 146072
39 175562
40 214708
41 256351
42 312583
43 371779

List of values

[0, 1, 3, 5, 10, 14, 27, 35, 61, 83, 128, 166, 264, 327, 482, 632, 882, 1110, 1565, 1938, 2663, 3339, 4401, 5471, 7290, 8921, 11555, 14291, 18280, 22303, 28507, 34507, 43534, 52882, 65798, 79621, 98932, 118629, 146072, 175562, 214708, 256351, 312583, 371779]