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.

A238354 Triangle T(n,k) read by rows: T(n,k) is the number of partitions of n (as weakly ascending list of parts) with minimal ascent k, n >= 0, 0 <= k <= n.

Table of values

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

List of values

[1, 1, 0, 2, 0, 0, 2, 1, 0, 0, 4, 0, 1, 0, 0, 5, 1, 0, 1, 0, 0, 8, 1, 1, 0, 1, 0, 0, 11, 2, 0, 1, 0, 1, 0, 0, 17, 2, 1, 0, 1, 0, 1, 0, 0, 23, 3, 1, 1, 0, 1, 0, 1, 0, 0, 33, 4, 2, 0, 1, 0, 1, 0, 1, 0, 0, 45, 5, 2, 1, 0, 1, 0, 1, 0, 1, 0, 0, 63, 6, 3, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 84, 8, 3, 2, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 114, 10, 4, 2, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0]