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.

A232697 Number of partitions of 2n into parts such that the largest multiplicity equals n.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 3
5 3
6 5
7 5
8 8
9 9
10 13
11 15
12 22
13 25
14 35
15 42
16 56
17 67
18 89
19 106
20 138
21 166
22 211
23 254
24 321
25 384
26 479
27 575
28 709
29 848
30 1040
31 1239
32 1508
33 1795
34 2168
35 2574
36 3095
37 3661
38 4379
39 5171
40 6154
41 7246
42 8592
43 10088
44 11915
45 13960
46 16425
47 19197
48 22520
49 26253
50 30702
51 35718

List of values

[1, 1, 2, 2, 3, 3, 5, 5, 8, 9, 13, 15, 22, 25, 35, 42, 56, 67, 89, 106, 138, 166, 211, 254, 321, 384, 479, 575, 709, 848, 1040, 1239, 1508, 1795, 2168, 2574, 3095, 3661, 4379, 5171, 6154, 7246, 8592, 10088, 11915, 13960, 16425, 19197, 22520, 26253, 30702, 35718]