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.

A240063 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 0
3 1
4 1
5 1
6 2
7 3
8 5
9 7
10 9
11 13
12 18
13 25
14 33
15 44
16 58
17 76
18 100
19 129
20 165
21 212
22 269
23 342
24 431
25 540
26 675
27 842
28 1045
29 1292
30 1592
31 1957
32 2397
33 2931
34 3569
35 4337
36 5258
37 6358
38 7671
39 9236
40 11091
41 13296
42 15906
43 18994
44 22634
45 26927
46 31974
47 37907
48 44867
49 53017
50 62547

List of values

[0, 0, 0, 1, 1, 1, 2, 3, 5, 7, 9, 13, 18, 25, 33, 44, 58, 76, 100, 129, 165, 212, 269, 342, 431, 540, 675, 842, 1045, 1292, 1592, 1957, 2397, 2931, 3569, 4337, 5258, 6358, 7671, 9236, 11091, 13296, 15906, 18994, 22634, 26927, 31974, 37907, 44867, 53017, 62547]