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.

A284611 Number of partitions of n such that the (sum of all even parts) = floor(n/2).

Table of values

n a(n)
1 1
2 0
3 0
4 1
5 2
6 0
7 0
8 4
9 6
10 0
11 0
12 12
13 15
14 0
15 0
16 30
17 40
18 0
19 0
20 70
21 84
22 0
23 0
24 165
25 198
26 0
27 0
28 330
29 405
30 0
31 0
32 704
33 836
34 0
35 0
36 1380
37 1620
38 0
39 0
40 2688
41 3192
42 0
43 0
44 4984
45 5824
46 0
47 0
48 9394
49 10934
50 0
51 0
52 16665
53 19392
54 0
55 0
56 29970
57 34560
58 0
59 0
60 52096

List of values

[1, 0, 0, 1, 2, 0, 0, 4, 6, 0, 0, 12, 15, 0, 0, 30, 40, 0, 0, 70, 84, 0, 0, 165, 198, 0, 0, 330, 405, 0, 0, 704, 836, 0, 0, 1380, 1620, 0, 0, 2688, 3192, 0, 0, 4984, 5824, 0, 0, 9394, 10934, 0, 0, 16665, 19392, 0, 0, 29970, 34560, 0, 0, 52096]