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.

A213177 Number T(n,k) of parts in all partitions of n with largest multiplicity k; 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 0
4 1
5 2
6 0
7 3
8 0
9 3
10 0
11 3
12 5
13 0
14 4
15 0
16 5
17 6
18 4
19 0
20 5
21 0
22 8
23 9
24 7
25 5
26 0
27 6
28 0
29 10
30 13
31 13
32 5
33 6
34 0
35 7
36 0
37 13
38 23
39 14
40 15
41 6
42 7
43 0
44 8
45 0
46 18
47 30
48 27
49 16
50 13
51 7
52 8
53 0
54 9
55 0
56 25
57 44
58 33
59 30
60 18
61 15
62 8
63 9
64 0
65 10
66 0
67 30
68 58
69 55
70 36
71 34
72 15
73 17
74 9
75 10
76 0
77 11

List of values

[0, 0, 1, 0, 1, 2, 0, 3, 0, 3, 0, 3, 5, 0, 4, 0, 5, 6, 4, 0, 5, 0, 8, 9, 7, 5, 0, 6, 0, 10, 13, 13, 5, 6, 0, 7, 0, 13, 23, 14, 15, 6, 7, 0, 8, 0, 18, 30, 27, 16, 13, 7, 8, 0, 9, 0, 25, 44, 33, 30, 18, 15, 8, 9, 0, 10, 0, 30, 58, 55, 36, 34, 15, 17, 9, 10, 0, 11]