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.

A239961 Number of partitions of n such that (number of distinct parts) = number of 2's.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 0
5 1
6 1
7 2
8 2
9 2
10 4
11 4
12 6
13 9
14 10
15 12
16 19
17 21
18 24
19 36
20 44
21 49
22 66
23 81
24 100
25 123
26 144
27 180
28 229
29 265
30 317
31 391
32 473
33 566
34 675
35 798
36 968
37 1154
38 1354
39 1621
40 1926
41 2241
42 2675
43 3170
44 3691
45 4345
46 5113
47 5956
48 7002
49 8182
50 9503
51 11095
52 12919
53 14976
54 17446

List of values

[1, 0, 1, 0, 0, 1, 1, 2, 2, 2, 4, 4, 6, 9, 10, 12, 19, 21, 24, 36, 44, 49, 66, 81, 100, 123, 144, 180, 229, 265, 317, 391, 473, 566, 675, 798, 968, 1154, 1354, 1621, 1926, 2241, 2675, 3170, 3691, 4345, 5113, 5956, 7002, 8182, 9503, 11095, 12919, 14976, 17446]