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.

A332673 Triangle read by rows where T(n,k) is the number of length-k ordered set partitions of {1..n} whose non-adjacent blocks are pairwise increasing.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 2
6 0
7 1
8 6
9 3
10 0
11 1
12 14
13 14
14 5
15 0
16 1
17 30
18 45
19 32
20 8
21 0
22 1
23 62
24 124
25 131
26 65
27 13
28 0
29 1
30 126
31 315
32 438
33 323
34 128
35 21
36 0
37 1
38 254
39 762
40 1305
41 1270
42 747
43 243
44 34
45 0
46 1
47 510
48 1785
49 3612
50 4346
51 3370
52 1629
53 452
54 55

List of values

[1, 0, 1, 0, 1, 2, 0, 1, 6, 3, 0, 1, 14, 14, 5, 0, 1, 30, 45, 32, 8, 0, 1, 62, 124, 131, 65, 13, 0, 1, 126, 315, 438, 323, 128, 21, 0, 1, 254, 762, 1305, 1270, 747, 243, 34, 0, 1, 510, 1785, 3612, 4346, 3370, 1629, 452, 55]