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.

A276921 Number A(n,k) of ordered set partitions of [n] with at most k elements per block; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 1
5 0
6 1
7 1
8 2
9 0
10 1
11 1
12 3
13 6
14 0
15 1
16 1
17 3
18 12
19 24
20 0
21 1
22 1
23 3
24 13
25 66
26 120
27 0
28 1
29 1
30 3
31 13
32 74
33 450
34 720
35 0
36 1
37 1
38 3
39 13
40 75
41 530
42 3690
43 5040
44 0
45 1
46 1
47 3
48 13
49 75
50 540
51 4550
52 35280
53 40320
54 0
55 1
56 1
57 3
58 13
59 75
60 541
61 4670
62 45570
63 385560
64 362880
65 0

List of values

[1, 1, 0, 1, 1, 0, 1, 1, 2, 0, 1, 1, 3, 6, 0, 1, 1, 3, 12, 24, 0, 1, 1, 3, 13, 66, 120, 0, 1, 1, 3, 13, 74, 450, 720, 0, 1, 1, 3, 13, 75, 530, 3690, 5040, 0, 1, 1, 3, 13, 75, 540, 4550, 35280, 40320, 0, 1, 1, 3, 13, 75, 541, 4670, 45570, 385560, 362880, 0]