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.

A365924 Number of incomplete 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 3
5 3
6 6
7 7
8 12
9 14
10 22
11 25
12 38
13 46
14 64
15 76
16 106
17 124
18 167
19 199
20 261
21 309
22 402
23 471
24 604
25 714
26 898
27 1053
28 1323
29 1542
30 1911
31 2237
32 2745
33 3201
34 3913
35 4536
36 5506
37 6402
38 7706
39 8918
40 10719
41 12364
42 14760
43 17045
44 20234
45 23296
46 27600
47 31678
48 37365
49 42910
50 50371
51 57695
52 67628
53 77300
54 90242
55 103131
56 119997

List of values

[0, 0, 1, 1, 3, 3, 6, 7, 12, 14, 22, 25, 38, 46, 64, 76, 106, 124, 167, 199, 261, 309, 402, 471, 604, 714, 898, 1053, 1323, 1542, 1911, 2237, 2745, 3201, 3913, 4536, 5506, 6402, 7706, 8918, 10719, 12364, 14760, 17045, 20234, 23296, 27600, 31678, 37365, 42910, 50371, 57695, 67628, 77300, 90242, 103131, 119997]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.