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.

A372762 Number T(n,k) of partitions of [n] having exactly k blocks of minimal 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 5
12 9
13 0
14 1
15 0
16 31
17 10
18 10
19 0
20 1
21 0
22 82
23 70
24 35
25 15
26 0
27 1
28 0
29 344
30 336
31 140
32 35
33 21
34 0
35 1
36 0
37 1661
38 1393
39 616
40 385
41 56
42 28
43 0
44 1
45 0
46 7942
47 6210
48 4984
49 1386
50 504
51 84
52 36
53 0
54 1
55 0
56 38721
57 41331
58 22590
59 8610
60 3717
61 840
62 120
63 45
64 0
65 1

List of values

[1, 0, 1, 0, 1, 1, 0, 4, 0, 1, 0, 5, 9, 0, 1, 0, 31, 10, 10, 0, 1, 0, 82, 70, 35, 15, 0, 1, 0, 344, 336, 140, 35, 21, 0, 1, 0, 1661, 1393, 616, 385, 56, 28, 0, 1, 0, 7942, 6210, 4984, 1386, 504, 84, 36, 0, 1, 0, 38721, 41331, 22590, 8610, 3717, 840, 120, 45, 0, 1]