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.

A240176 Number of partitions of n such that (least part) > (multiplicity of least part).

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 1
5 2
6 3
7 3
8 5
9 5
10 8
11 10
12 13
13 15
14 21
15 25
16 31
17 39
18 50
19 59
20 75
21 89
22 111
23 134
24 164
25 194
26 240
27 285
28 344
29 410
30 493
31 582
32 699
33 824
34 981
35 1157
36 1369
37 1606
38 1901
39 2223
40 2613
41 3054
42 3579
43 4166
44 4871
45 5658
46 6590
47 7645
48 8877
49 10264
50 11900
51 13733
52 15868

List of values

[1, 0, 1, 1, 1, 2, 3, 3, 5, 5, 8, 10, 13, 15, 21, 25, 31, 39, 50, 59, 75, 89, 111, 134, 164, 194, 240, 285, 344, 410, 493, 582, 699, 824, 981, 1157, 1369, 1606, 1901, 2223, 2613, 3054, 3579, 4166, 4871, 5658, 6590, 7645, 8877, 10264, 11900, 13733, 15868]