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.

A372722 Number T(n,k) of partitions of [n] having exactly k blocks of maximal size; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 1
6 0
7 4
8 0
9 1
10 0
11 11
12 3
13 0
14 1
15 0
16 36
17 15
18 0
19 0
20 1
21 0
22 132
23 55
24 15
25 0
26 0
27 1
28 0
29 596
30 175
31 105
32 0
33 0
34 0
35 1
36 0
37 2809
38 805
39 420
40 105
41 0
42 0
43 0
44 1
45 0
46 14608
47 4053
48 1540
49 945
50 0
51 0
52 0
53 0
54 1
55 0
56 79448
57 24906
58 5950
59 4725
60 945
61 0
62 0
63 0
64 0
65 1
66 0
67 461748
68 151371
69 37730
70 17325
71 10395
72 0
73 0
74 0
75 0
76 0
77 1

List of values

[1, 0, 1, 0, 1, 1, 0, 4, 0, 1, 0, 11, 3, 0, 1, 0, 36, 15, 0, 0, 1, 0, 132, 55, 15, 0, 0, 1, 0, 596, 175, 105, 0, 0, 0, 1, 0, 2809, 805, 420, 105, 0, 0, 0, 1, 0, 14608, 4053, 1540, 945, 0, 0, 0, 0, 1, 0, 79448, 24906, 5950, 4725, 945, 0, 0, 0, 0, 1, 0, 461748, 151371, 37730, 17325, 10395, 0, 0, 0, 0, 0, 1]