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.

A374932 Number T(n,k) of partitions of [n] such that the maximal block element sum equals k; triangle T(n,k), n>=0, n <= k <= A000217(n), read by rows.

Table of values

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

List of values

[1, 1, 1, 1, 2, 1, 1, 1, 3, 3, 3, 3, 1, 1, 1, 6, 6, 8, 9, 9, 5, 3, 3, 1, 1, 1, 12, 14, 20, 31, 26, 32, 19, 14, 11, 10, 5, 3, 3, 1, 1, 1, 26, 31, 59, 78, 111, 108, 113, 76, 67, 57, 39, 39, 21, 16, 12, 10, 5, 3, 3, 1, 1, 1, 57, 84, 140, 260, 321, 458, 427, 500, 326, 300, 284, 229, 182, 159, 107, 79, 64, 46, 41, 23, 17, 12, 10, 5, 3, 3, 1, 1, 1]