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.

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

Table of values

n a(n)
0 0
1 0
2 1
3 1
4 2
5 2
6 4
7 6
8 9
9 12
10 17
11 23
12 33
13 43
14 59
15 76
16 102
17 132
18 173
19 221
20 285
21 361
22 462
23 580
24 733
25 913
26 1144
27 1418
28 1761
29 2168
30 2673
31 3273
32 4012
33 4885
34 5952
35 7212
36 8741
37 10546
38 12719
39 15279
40 18344
41 21949
42 26247
43 31287
44 37268
45 44267
46 52541
47 62207
48 73584

List of values

[0, 0, 1, 1, 2, 2, 4, 6, 9, 12, 17, 23, 33, 43, 59, 76, 102, 132, 173, 221, 285, 361, 462, 580, 733, 913, 1144, 1418, 1761, 2168, 2673, 3273, 4012, 4885, 5952, 7212, 8741, 10546, 12719, 15279, 18344, 21949, 26247, 31287, 37268, 44267, 52541, 62207, 73584]