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.

A287416 Number T(n,k) of set partitions of [n] such that the maximal value of all absolute differences between least elements of consecutive blocks and between consecutive elements within the 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 0
3 2
4 0
5 3
6 2
7 0
8 4
9 8
10 3
11 0
12 5
13 22
14 19
15 6
16 0
17 6
18 52
19 81
20 48
21 16
22 0
23 7
24 114
25 289
26 267
27 147
28 53
29 0
30 8
31 240
32 941
33 1250
34 968
35 529
36 204
37 0
38 9
39 494
40 2894
41 5310
42 5469
43 3919
44 2174
45 878
46 0
47 10
48 1004
49 8601
50 21256
51 28083
52 25326
53 17593
54 9961
55 4141

List of values

[1, 1, 0, 2, 0, 3, 2, 0, 4, 8, 3, 0, 5, 22, 19, 6, 0, 6, 52, 81, 48, 16, 0, 7, 114, 289, 267, 147, 53, 0, 8, 240, 941, 1250, 968, 529, 204, 0, 9, 494, 2894, 5310, 5469, 3919, 2174, 878, 0, 10, 1004, 8601, 21256, 28083, 25326, 17593, 9961, 4141]