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.

A238353 Triangle T(n,k) read by rows: T(n,k) is the number of partitions of n (as weakly ascending list of parts) with maximal 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 3
11 1
12 1
13 0
14 0
15 2
16 3
17 1
18 1
19 0
20 0
21 4
22 3
23 2
24 1
25 1
26 0
27 0
28 2
29 6
30 3
31 2
32 1
33 1
34 0
35 0
36 4
37 6
38 6
39 2
40 2
41 1
42 1
43 0
44 0
45 3
46 10
47 6
48 5
49 2
50 2
51 1
52 1
53 0
54 0
55 4
56 11
57 11
58 6
59 4
60 2
61 2
62 1
63 1
64 0
65 0
66 2
67 16
68 13
69 10
70 5
71 4
72 2
73 2
74 1
75 1
76 0
77 0
78 6
79 17
80 19
81 12
82 9
83 4
84 4
85 2
86 2
87 1
88 1
89 0
90 0
91 2
92 24
93 24
94 18
95 11
96 8
97 4
98 4
99 2
100 2
101 1
102 1
103 0
104 0

List of values

[1, 1, 0, 2, 0, 0, 2, 1, 0, 0, 3, 1, 1, 0, 0, 2, 3, 1, 1, 0, 0, 4, 3, 2, 1, 1, 0, 0, 2, 6, 3, 2, 1, 1, 0, 0, 4, 6, 6, 2, 2, 1, 1, 0, 0, 3, 10, 6, 5, 2, 2, 1, 1, 0, 0, 4, 11, 11, 6, 4, 2, 2, 1, 1, 0, 0, 2, 16, 13, 10, 5, 4, 2, 2, 1, 1, 0, 0, 6, 17, 19, 12, 9, 4, 4, 2, 2, 1, 1, 0, 0, 2, 24, 24, 18, 11, 8, 4, 4, 2, 2, 1, 1, 0, 0]