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.

A240056 Number of partitions of n such that m(1) > m(2), where m = multiplicity.

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 3
5 4
6 5
7 9
8 12
9 16
10 24
11 32
12 42
13 59
14 77
15 100
16 134
17 173
18 221
19 288
20 366
21 463
22 590
23 741
24 926
25 1163
26 1444
27 1787
28 2215
29 2726
30 3342
31 4101
32 5003
33 6087
34 7402
35 8964
36 10827
37 13069
38 15718
39 18865
40 22617
41 27041
42 32263
43 38453
44 45719
45 54264
46 64326
47 76102
48 89884

List of values

[0, 1, 1, 1, 3, 4, 5, 9, 12, 16, 24, 32, 42, 59, 77, 100, 134, 173, 221, 288, 366, 463, 590, 741, 926, 1163, 1444, 1787, 2215, 2726, 3342, 4101, 5003, 6087, 7402, 8964, 10827, 13069, 15718, 18865, 22617, 27041, 32263, 38453, 45719, 54264, 64326, 76102, 89884]