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.

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

Table of values

n a(n)
1 1
2 0
3 0
4 2
5 3
6 0
7 0
8 3
9 4
10 0
11 0
12 15
13 20
14 0
15 0
16 23
17 31
18 0
19 0
20 55
21 70
22 0
23 0
24 153
25 195
26 0
27 0
28 265
29 335
30 0
31 0
32 535
33 664
34 0
35 0
36 988
37 1208
38 0
39 0
40 2242
41 2750
42 0
43 0
44 3580
45 4332
46 0
47 0
48 6941
49 8349
50 0
51 0
52 11621
53 13909
54 0
55 0
56 20681
57 24585
58 0
59 0
60 37202

List of values

[1, 0, 0, 2, 3, 0, 0, 3, 4, 0, 0, 15, 20, 0, 0, 23, 31, 0, 0, 55, 70, 0, 0, 153, 195, 0, 0, 265, 335, 0, 0, 535, 664, 0, 0, 988, 1208, 0, 0, 2242, 2750, 0, 0, 3580, 4332, 0, 0, 6941, 8349, 0, 0, 11621, 13909, 0, 0, 20681, 24585, 0, 0, 37202]