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.

A365831 Number of incomplete strict integer partitions of n, meaning not every number from 0 to n is the sum of some submultiset.

Table of values

n a(n)
0 0
1 0
2 1
3 1
4 2
5 3
6 3
7 4
8 6
9 8
10 9
11 11
12 13
13 16
14 21
15 25
16 31
17 36
18 43
19 50
20 59
21 69
22 82
23 96
24 113
25 131
26 155
27 179
28 208
29 239
30 276
31 315
32 362
33 414
34 472
35 539
36 614
37 698
38 795
39 902
40 1023
41 1158
42 1311
43 1479
44 1672
45 1881
46 2118
47 2377
48 2671
49 2991
50 3354
51 3748
52 4194
53 4679
54 5223
55 5815

List of values

[0, 0, 1, 1, 2, 3, 3, 4, 6, 8, 9, 11, 13, 16, 21, 25, 31, 36, 43, 50, 59, 69, 82, 96, 113, 131, 155, 179, 208, 239, 276, 315, 362, 414, 472, 539, 614, 698, 795, 902, 1023, 1158, 1311, 1479, 1672, 1881, 2118, 2377, 2671, 2991, 3354, 3748, 4194, 4679, 5223, 5815]