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.

A287641 Number A(n,k) of set partitions of [n] such that j is member of block b only if b = 1 or at least one of j-1, ..., j-k is member of a block >= b-1; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 2
9 1
10 1
11 1
12 2
13 5
14 1
15 1
16 1
17 2
18 5
19 14
20 1
21 1
22 1
23 2
24 5
25 15
26 42
27 1
28 1
29 1
30 2
31 5
32 15
33 51
34 132
35 1
36 1
37 1
38 2
39 5
40 15
41 52
42 191
43 429
44 1
45 1
46 1
47 2
48 5
49 15
50 52
51 202
52 773
53 1430
54 1
55 1
56 1
57 2
58 5
59 15
60 52
61 203
62 861
63 3336
64 4862
65 1
66 1
67 1
68 2
69 5
70 15
71 52
72 203
73 876
74 3970
75 15207
76 16796
77 1

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 5, 1, 1, 1, 2, 5, 14, 1, 1, 1, 2, 5, 15, 42, 1, 1, 1, 2, 5, 15, 51, 132, 1, 1, 1, 2, 5, 15, 52, 191, 429, 1, 1, 1, 2, 5, 15, 52, 202, 773, 1430, 1, 1, 1, 2, 5, 15, 52, 203, 861, 3336, 4862, 1, 1, 1, 2, 5, 15, 52, 203, 876, 3970, 15207, 16796, 1]