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.

A338915 Number of integer partitions of n that have an even number of parts and cannot be partitioned into distinct pairs of not necessarily distinct parts.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 1
5 0
6 1
7 1
8 4
9 2
10 6
11 6
12 12
13 12
14 20
15 22
16 38
17 42
18 60
19 73
20 101
21 124
22 164
23 203
24 266
25 319
26 415
27 507
28 649
29 786
30 983
31 1198
32 1499
33 1797
34 2234
35 2673
36 3303
37 3952
38 4826
39 5753
40 6999
41 8330
42 10051
43 11943
44 14357
45 16956
46 20322
47 23997
48 28568
49 33657
50 39897
51 46879

List of values

[0, 0, 0, 0, 1, 0, 1, 1, 4, 2, 6, 6, 12, 12, 20, 22, 38, 42, 60, 73, 101, 124, 164, 203, 266, 319, 415, 507, 649, 786, 983, 1198, 1499, 1797, 2234, 2673, 3303, 3952, 4826, 5753, 6999, 8330, 10051, 11943, 14357, 16956, 20322, 23997, 28568, 33657, 39897, 46879]