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.

A243978 Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) is the number of partitions of n where the minimal multiplicity of any part is k.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 1
6 0
7 2
8 0
9 1
10 0
11 3
12 1
13 0
14 1
15 0
16 6
17 0
18 0
19 0
20 1
21 0
22 7
23 2
24 1
25 0
26 0
27 1
28 0
29 13
30 1
31 0
32 0
33 0
34 0
35 1
36 0
37 16
38 4
39 0
40 1
41 0
42 0
43 0
44 1
45 0
46 25
47 2
48 2
49 0
50 0
51 0
52 0
53 0
54 1
55 0
56 33
57 6
58 1
59 0
60 1
61 0
62 0
63 0
64 0
65 1
66 0
67 49
68 4
69 2
70 0
71 0
72 0
73 0
74 0
75 0
76 0
77 1
78 0
79 61
80 9
81 3
82 2
83 0
84 1
85 0
86 0
87 0
88 0
89 0
90 1
91 0
92 90
93 6
94 3
95 1
96 0
97 0
98 0
99 0
100 0
101 0
102 0
103 0
104 1
105 0
106 113
107 16
108 2
109 2
110 0
111 0
112 1
113 0
114 0
115 0
116 0
117 0
118 0
119 1
120 0
121 156
122 9
123 7
124 1
125 2
126 0
127 0
128 0
129 0
130 0
131 0
132 0
133 0
134 0
135 1

List of values

[1, 0, 1, 0, 1, 1, 0, 2, 0, 1, 0, 3, 1, 0, 1, 0, 6, 0, 0, 0, 1, 0, 7, 2, 1, 0, 0, 1, 0, 13, 1, 0, 0, 0, 0, 1, 0, 16, 4, 0, 1, 0, 0, 0, 1, 0, 25, 2, 2, 0, 0, 0, 0, 0, 1, 0, 33, 6, 1, 0, 1, 0, 0, 0, 0, 1, 0, 49, 4, 2, 0, 0, 0, 0, 0, 0, 0, 1, 0, 61, 9, 3, 2, 0, 1, 0, 0, 0, 0, 0, 1, 0, 90, 6, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 113, 16, 2, 2, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 156, 9, 7, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]