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.

A271424 Number T(n,k) of set partitions of [n] with minimal block length multiplicity equal to k; 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 51
17 0
18 0
19 0
20 1
21 0
22 132
23 55
24 15
25 0
26 0
27 1
28 0
29 771
30 105
31 0
32 0
33 0
34 0
35 1
36 0
37 3089
38 945
39 0
40 105
41 0
42 0
43 0
44 1
45 0
46 18388
47 1218
48 1540
49 0
50 0
51 0
52 0
53 0
54 1
55 0
56 96423
57 15456
58 3150
59 0
60 945
61 0
62 0
63 0
64 0
65 1
66 0
67 627529
68 26785
69 24255
70 0
71 0
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, 51, 0, 0, 0, 1, 0, 132, 55, 15, 0, 0, 1, 0, 771, 105, 0, 0, 0, 0, 1, 0, 3089, 945, 0, 105, 0, 0, 0, 1, 0, 18388, 1218, 1540, 0, 0, 0, 0, 0, 1, 0, 96423, 15456, 3150, 0, 945, 0, 0, 0, 0, 1, 0, 627529, 26785, 24255, 0, 0, 0, 0, 0, 0, 0, 1]