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.

A247255 Triangular array read by rows: T(n,k) is the number of weakly unimodal partitions of n in which the greatest part occurs exactly k times, n>=1, 1<=k<=n.

Table of values

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

List of values

[1, 1, 1, 3, 0, 1, 6, 1, 0, 1, 12, 2, 0, 0, 1, 21, 4, 1, 0, 0, 1, 38, 6, 2, 0, 0, 0, 1, 63, 11, 3, 1, 0, 0, 0, 1, 106, 16, 5, 2, 0, 0, 0, 0, 1, 170, 27, 7, 3, 1, 0, 0, 0, 0, 1, 272, 40, 11, 4, 2, 0, 0, 0, 0, 0, 1, 422, 63, 16, 6, 3, 1, 0, 0, 0, 0, 0, 1, 653, 92, 24, 8, 4, 2, 0, 0, 0, 0, 0, 0, 1, 986, 141, 34, 12, 5, 3, 1, 0, 0, 0, 0, 0, 0, 1]