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.

A229816 Number of partitions of n such that if the length is k then k is not a part.

Table of values

n a(n)
0 1
1 0
2 2
3 2
4 4
5 5
6 9
7 11
8 18
9 23
10 34
11 44
12 63
13 80
14 111
15 142
16 190
17 242
18 319
19 402
20 522
21 655
22 837
23 1045
24 1322
25 1638
26 2053
27 2532
28 3144
29 3857
30 4757
31 5803
32 7111
33 8636
34 10516
35 12716
36 15404
37 18543
38 22355
39 26807
40 32168
41 38430
42 45929
43 54670
44 65088
45 77220
46 91599
47 108330
48 128077
49 151006
50 177974

List of values

[1, 0, 2, 2, 4, 5, 9, 11, 18, 23, 34, 44, 63, 80, 111, 142, 190, 242, 319, 402, 522, 655, 837, 1045, 1322, 1638, 2053, 2532, 3144, 3857, 4757, 5803, 7111, 8636, 10516, 12716, 15404, 18543, 22355, 26807, 32168, 38430, 45929, 54670, 65088, 77220, 91599, 108330, 128077, 151006, 177974]