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.

A298668 Number T(n,k) of set partitions of [n] into k blocks such that the absolute difference between least elements of consecutive blocks is always > 1; triangle T(n,k), n>=0, 0<=k<=ceiling(n/2), read by rows.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 0
6 1
7 1
8 0
9 1
10 3
11 0
12 1
13 7
14 2
15 0
16 1
17 15
18 12
19 0
20 1
21 31
22 50
23 6
24 0
25 1
26 63
27 180
28 60
29 0
30 1
31 127
32 602
33 390
34 24
35 0
36 1
37 255
38 1932
39 2100
40 360
41 0
42 1
43 511
44 6050
45 10206
46 3360
47 120
48 0
49 1
50 1023
51 18660
52 46620
53 25200
54 2520
55 0
56 1
57 2047
58 57002
59 204630
60 166824
61 31920
62 720

List of values

[1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 3, 0, 1, 7, 2, 0, 1, 15, 12, 0, 1, 31, 50, 6, 0, 1, 63, 180, 60, 0, 1, 127, 602, 390, 24, 0, 1, 255, 1932, 2100, 360, 0, 1, 511, 6050, 10206, 3360, 120, 0, 1, 1023, 18660, 46620, 25200, 2520, 0, 1, 2047, 57002, 204630, 166824, 31920, 720]