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.

A287215 Number T(n,k) of set partitions of [n] such that the maximal absolute difference between the least elements of consecutive blocks equals k; triangle T(n,k), n>=0, 0<=k<=max(n-1,0), read by rows.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 3
6 1
7 1
8 8
9 5
10 1
11 1
12 22
13 21
14 7
15 1
16 1
17 65
18 86
19 39
20 11
21 1
22 1
23 209
24 361
25 209
26 77
27 19
28 1
29 1
30 732
31 1584
32 1123
33 493
34 171
35 35
36 1
37 1
38 2780
39 7315
40 6153
41 3124
42 1293
43 413
44 67
45 1
46 1
47 11377
48 35635
49 34723
50 20019
51 9320
52 3709
53 1059
54 131
55 1
56 1
57 49863
58 183080
59 202852
60 130916
61 66992
62 30396
63 11373
64 2837
65 259
66 1

List of values

[1, 1, 1, 1, 1, 3, 1, 1, 8, 5, 1, 1, 22, 21, 7, 1, 1, 65, 86, 39, 11, 1, 1, 209, 361, 209, 77, 19, 1, 1, 732, 1584, 1123, 493, 171, 35, 1, 1, 2780, 7315, 6153, 3124, 1293, 413, 67, 1, 1, 11377, 35635, 34723, 20019, 9320, 3709, 1059, 131, 1, 1, 49863, 183080, 202852, 130916, 66992, 30396, 11373, 2837, 259, 1]