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.

A287417 Number A(n,k) of set partitions of [n] such that all absolute differences between least elements of consecutive blocks and between consecutive elements within the blocks are not larger than 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 0
6 1
7 1
8 2
9 0
10 1
11 1
12 2
13 3
14 0
15 1
16 1
17 2
18 5
19 4
20 0
21 1
22 1
23 2
24 5
25 12
26 5
27 0
28 1
29 1
30 2
31 5
32 15
33 27
34 6
35 0
36 1
37 1
38 2
39 5
40 15
41 46
42 58
43 7
44 0
45 1
46 1
47 2
48 5
49 15
50 52
51 139
52 121
53 8
54 0
55 1
56 1
57 2
58 5
59 15
60 52
61 187
62 410
63 248
64 9
65 0
66 1
67 1
68 2
69 5
70 15
71 52
72 203
73 677
74 1189
75 503
76 10
77 0

List of values

[1, 1, 1, 1, 1, 0, 1, 1, 2, 0, 1, 1, 2, 3, 0, 1, 1, 2, 5, 4, 0, 1, 1, 2, 5, 12, 5, 0, 1, 1, 2, 5, 15, 27, 6, 0, 1, 1, 2, 5, 15, 46, 58, 7, 0, 1, 1, 2, 5, 15, 52, 139, 121, 8, 0, 1, 1, 2, 5, 15, 52, 187, 410, 248, 9, 0, 1, 1, 2, 5, 15, 52, 203, 677, 1189, 503, 10, 0]