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.

A220484 Triangle read by rows: T(j,k) is the total number of appearances of the smallest parts in the j-th partition of n, with partitions as nonincreasing lists of parts in lexicographic order.

Table of values

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

List of values

[1, 2, 1, 3, 1, 1, 4, 2, 1, 2, 1, 5, 3, 2, 1, 1, 1, 1, 6, 4, 3, 2, 2, 1, 1, 3, 1, 2, 1, 7, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 8, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 4, 2, 1, 1, 1, 2, 1, 9, 7, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 3, 1, 1, 1]