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.

A240058 Number of partitions of n such that m(1) = m(3), where m = multiplicity.

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 3
6 1
7 4
8 2
9 8
10 5
11 12
12 9
13 21
14 17
15 32
16 29
17 52
18 49
19 79
20 79
21 123
22 126
23 184
24 195
25 278
26 299
27 409
28 449
29 603
30 668
31 874
32 979
33 1263
34 1423
35 1803
36 2045
37 2563
38 2916
39 3608
40 4121
41 5056
42 5783
43 7029
44 8055
45 9725
46 11151
47 13366
48 15337
49 18285
50 20979
51 24871
52 28535

List of values

[1, 0, 1, 0, 3, 1, 4, 2, 8, 5, 12, 9, 21, 17, 32, 29, 52, 49, 79, 79, 123, 126, 184, 195, 278, 299, 409, 449, 603, 668, 874, 979, 1263, 1423, 1803, 2045, 2563, 2916, 3608, 4121, 5056, 5783, 7029, 8055, 9725, 11151, 13366, 15337, 18285, 20979, 24871, 28535]