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.

A222730 Total sum T(n,k) of parts <= n of multiplicity k in all partitions of n; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

n a(n)
0 0
1 0
2 1
3 3
4 2
5 1
6 11
7 6
8 0
9 1
10 36
11 10
12 3
13 0
14 1
15 79
16 21
17 3
18 1
19 0
20 1
21 186
22 33
23 7
24 3
25 1
26 0
27 1
28 345
29 59
30 9
31 4
32 1
33 1
34 0
35 1
36 672
37 89
38 20
39 4
40 4
41 1
42 1
43 0
44 1
45 1163
46 145
47 22
48 11
49 4
50 2
51 1
52 1
53 0
54 1
55 2026
56 212
57 44
58 13
59 6
60 4
61 2
62 1
63 1
64 0
65 1
66 3273
67 325
68 56
69 21
70 8
71 6
72 2
73 2
74 1
75 1
76 0
77 1

List of values

[0, 0, 1, 3, 2, 1, 11, 6, 0, 1, 36, 10, 3, 0, 1, 79, 21, 3, 1, 0, 1, 186, 33, 7, 3, 1, 0, 1, 345, 59, 9, 4, 1, 1, 0, 1, 672, 89, 20, 4, 4, 1, 1, 0, 1, 1163, 145, 22, 11, 4, 2, 1, 1, 0, 1, 2026, 212, 44, 13, 6, 4, 2, 1, 1, 0, 1, 3273, 325, 56, 21, 8, 6, 2, 2, 1, 1, 0, 1]