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.

A365323 Number of integer partitions with sum < n whose distinct parts cannot be linearly combined using all positive coefficients to obtain n.

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 4
6 3
7 9
8 7
9 15
10 16
11 29
12 23
13 47
14 43
15 74
16 65
17 114
18 100
19 174
20 153
21 257
22 228
23 368
24 312
25 530
26 454
27 736
28 645
29 1025
30 902
31 1402
32 1184
33 1909
34 1626
35 2618
36 2184
37 3412
38 2895
39 4551
40 3887
41 5966
42 5055
43 7796
44 6509
45 10244
46 8462
47 13060
48 10881
49 16834
50 14021
51 21471

List of values

[0, 0, 1, 1, 4, 3, 9, 7, 15, 16, 29, 23, 47, 43, 74, 65, 114, 100, 174, 153, 257, 228, 368, 312, 530, 454, 736, 645, 1025, 902, 1402, 1184, 1909, 1626, 2618, 2184, 3412, 2895, 4551, 3887, 5966, 5055, 7796, 6509, 10244, 8462, 13060, 10881, 16834, 14021, 21471]