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.

A328362 Triangle read by rows: T(n,k) is the sum of all parts k in all partitions of n into consecutive parts, (1 <= k <= n).

Table of values

n a(n)
1 1
2 0
3 2
4 1
5 2
6 3
7 0
8 0
9 0
10 4
11 0
12 2
13 3
14 0
15 5
16 1
17 2
18 3
19 0
20 0
21 6
22 0
23 0
24 3
25 4
26 0
27 0
28 7
29 0
30 0
31 0
32 0
33 0
34 0
35 0
36 8
37 0
38 2
39 3
40 8
41 5
42 0
43 0
44 0
45 9
46 1
47 2
48 3
49 4
50 0
51 0
52 0
53 0
54 0
55 10
56 0
57 0
58 0
59 0
60 5
61 6
62 0
63 0
64 0
65 0
66 11
67 0
68 0
69 3
70 4
71 5
72 0
73 0
74 0
75 0
76 0
77 0
78 12
79 0
80 0
81 0
82 0
83 0
84 6
85 7
86 0
87 0
88 0
89 0
90 0
91 13
92 0
93 2
94 3
95 4
96 5
97 0
98 0
99 0
100 0
101 0
102 0
103 0
104 0
105 14

List of values

[1, 0, 2, 1, 2, 3, 0, 0, 0, 4, 0, 2, 3, 0, 5, 1, 2, 3, 0, 0, 6, 0, 0, 3, 4, 0, 0, 7, 0, 0, 0, 0, 0, 0, 0, 8, 0, 2, 3, 8, 5, 0, 0, 0, 9, 1, 2, 3, 4, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 5, 6, 0, 0, 0, 0, 11, 0, 0, 3, 4, 5, 0, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 6, 7, 0, 0, 0, 0, 0, 13, 0, 2, 3, 4, 5, 0, 0, 0, 0, 0, 0, 0, 0, 14]