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.

A287216 Number A(n,k) of set partitions of [n] such that all absolute differences between least elements of consecutive blocks are <= k; 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 4
14 1
15 1
16 1
17 2
18 5
19 9
20 1
21 1
22 1
23 2
24 5
25 14
26 23
27 1
28 1
29 1
30 2
31 5
32 15
33 44
34 66
35 1
36 1
37 1
38 2
39 5
40 15
41 51
42 152
43 210
44 1
45 1
46 1
47 2
48 5
49 15
50 52
51 191
52 571
53 733
54 1
55 1
56 1
57 2
58 5
59 15
60 52
61 202
62 780
63 2317
64 2781
65 1
66 1
67 1
68 2
69 5
70 15
71 52
72 203
73 857
74 3440
75 10096
76 11378
77 1

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 4, 1, 1, 1, 2, 5, 9, 1, 1, 1, 2, 5, 14, 23, 1, 1, 1, 2, 5, 15, 44, 66, 1, 1, 1, 2, 5, 15, 51, 152, 210, 1, 1, 1, 2, 5, 15, 52, 191, 571, 733, 1, 1, 1, 2, 5, 15, 52, 202, 780, 2317, 2781, 1, 1, 1, 2, 5, 15, 52, 203, 857, 3440, 10096, 11378, 1]