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.

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

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 4
6 5
7 6
8 8
9 11
10 16
11 20
12 26
13 33
14 43
15 56
16 71
17 89
18 112
19 140
20 177
21 219
22 271
23 333
24 411
25 505
26 617
27 750
28 912
29 1105
30 1339
31 1612
32 1940
33 2327
34 2789
35 3334
36 3978
37 4733
38 5625
39 6670
40 7903
41 9338
42 11021
43 12980
44 15273
45 17940
46 21043
47 24640
48 28822
49 33661
50 39273

List of values

[1, 1, 1, 1, 2, 4, 5, 6, 8, 11, 16, 20, 26, 33, 43, 56, 71, 89, 112, 140, 177, 219, 271, 333, 411, 505, 617, 750, 912, 1105, 1339, 1612, 1940, 2327, 2789, 3334, 3978, 4733, 5625, 6670, 7903, 9338, 11021, 12980, 15273, 17940, 21043, 24640, 28822, 33661, 39273]