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.

A239948 Number of partitions of n such that (number of distinct parts) < least part.

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 2
5 1
6 3
7 2
8 4
9 4
10 6
11 6
12 9
13 9
14 12
15 14
16 17
17 18
18 25
19 26
20 32
21 38
22 43
23 49
24 62
25 65
26 78
27 92
28 103
29 114
30 142
31 151
32 175
33 203
34 229
35 252
36 302
37 323
38 378
39 422
40 477
41 524
42 619
43 661
44 758
45 847
46 958
47 1038
48 1204
49 1297
50 1485
51 1626
52 1829
53 1989
54 2285
55 2459
56 2770
57 3035

List of values

[1, 0, 1, 1, 2, 1, 3, 2, 4, 4, 6, 6, 9, 9, 12, 14, 17, 18, 25, 26, 32, 38, 43, 49, 62, 65, 78, 92, 103, 114, 142, 151, 175, 203, 229, 252, 302, 323, 378, 422, 477, 524, 619, 661, 758, 847, 958, 1038, 1204, 1297, 1485, 1626, 1829, 1989, 2285, 2459, 2770, 3035]