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.

A329323 Triangle read by rows: T(n,k) is the sum of the parts congruent to 0 mod k in the partitions of n into equal parts, 1 <= k <= n.

Table of values

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

List of values

[1, 4, 2, 6, 0, 3, 12, 8, 0, 4, 10, 0, 0, 0, 5, 24, 12, 12, 0, 0, 6, 14, 0, 0, 0, 0, 0, 7, 32, 24, 0, 16, 0, 0, 0, 8, 27, 0, 18, 0, 0, 0, 0, 0, 9, 40, 20, 0, 0, 20, 0, 0, 0, 0, 10, 22, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 72, 48, 36, 24, 0, 24, 0, 0, 0, 0, 0, 12, 26, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 56, 28, 0, 0]