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.

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

Table of values

n a(n)
1 0
2 1
3 2
4 0
5 0
6 1
7 2
8 5
9 6
10 1
11 3
12 8
13 9
14 1
15 5
16 20
17 20
18 28
19 45
20 30
21 29
22 43
23 69
24 60
25 51
26 119
27 174
28 86
29 75
30 213
31 307
32 355
33 375
34 416
35 583
36 517
37 541
38 663
39 923
40 1198
41 1291
42 1205
43 1650
44 2156
45 2365
46 1803
47 2469
48 4196
49 4596
50 4637
51 6073
52 6684
53 7374
54 6740
55 8829
56 12345

List of values

[0, 1, 2, 0, 0, 1, 2, 5, 6, 1, 3, 8, 9, 1, 5, 20, 20, 28, 45, 30, 29, 43, 69, 60, 51, 119, 174, 86, 75, 213, 307, 355, 375, 416, 583, 517, 541, 663, 923, 1198, 1291, 1205, 1650, 2156, 2365, 1803, 2469, 4196, 4596, 4637, 6073, 6684, 7374, 6740, 8829, 12345]