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.

A245841 Triangle T read by rows: T(n,k) = Total number of odd parts in all partitions of n with at most k parts, 1 <= k <= n.

Table of values

n a(n)
1 1
2 0
3 2
4 1
5 2
6 5
7 0
8 2
9 4
10 8
11 1
12 3
13 7
14 10
15 15
16 0
17 4
18 8
19 14
20 18
21 24
22 1
23 4
24 12
25 19
26 27
27 32
28 39
29 0
30 4
31 12
32 24
33 34
34 44
35 50
36 58
37 1
38 5
39 18
40 32
41 49
42 62
43 74
44 81
45 90
46 0
47 6
48 18
49 40
50 60
51 82
52 98
53 112
54 120
55 130
56 1
57 6
58 24
59 49
60 81
61 108
62 135
63 154
64 170
65 179
66 190

List of values

[1, 0, 2, 1, 2, 5, 0, 2, 4, 8, 1, 3, 7, 10, 15, 0, 4, 8, 14, 18, 24, 1, 4, 12, 19, 27, 32, 39, 0, 4, 12, 24, 34, 44, 50, 58, 1, 5, 18, 32, 49, 62, 74, 81, 90, 0, 6, 18, 40, 60, 82, 98, 112, 120, 130, 1, 6, 24, 49, 81, 108, 135, 154, 170, 179, 190]