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.

A364910 Number of integer partitions of 2n whose distinct parts sum to n.

Table of values

n a(n)
0 1
1 1
2 1
3 3
4 3
5 4
6 12
7 11
8 19
9 23
10 54
11 55
12 103
13 115
14 178
15 289
16 389
17 507
18 757
19 970
20 1343
21 2033
22 2579
23 3481
24 4840
25 6312
26 8317
27 10998
28 15459
29 19334
30 26368
31 33480
32 44709
33 56838
34 74878
35 93369
36 128109
37 157024
38 206471
39 258357
40 338085
41 417530
42 544263
43 669388
44 859570
45 1082758
46 1367068

List of values

[1, 1, 1, 3, 3, 4, 12, 11, 19, 23, 54, 55, 103, 115, 178, 289, 389, 507, 757, 970, 1343, 2033, 2579, 3481, 4840, 6312, 8317, 10998, 15459, 19334, 26368, 33480, 44709, 56838, 74878, 93369, 128109, 157024, 206471, 258357, 338085, 417530, 544263, 669388, 859570, 1082758, 1367068]