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.

A056862 Triangle T(n,k) is the number of restricted growth strings (RGS) of set partitions of {1..n} that have a decrease at index k (1<=k

Table of values

n a(n)
2 0
3 0
4 1
5 0
6 3
7 4
8 0
9 10
10 14
11 16
12 0
13 37
14 54
15 63
16 68
17 0
18 151
19 228
20 271
21 296
22 311
23 0
24 674
25 1046
26 1264
27 1396
28 1478
29 1530
30 0
31 3263
32 5178
33 6349
34 7084
35 7555
36 7862
37 8065
38 0
39 17007
40 27488
41 34139
42 38448
43 41287
44 43184
45 44467
46 45344
47 0
48 94828
49 155642
50 195494
51 222044
52 239976
53 252230
54 260690
55 266584
56 270724

List of values

[0, 0, 1, 0, 3, 4, 0, 10, 14, 16, 0, 37, 54, 63, 68, 0, 151, 228, 271, 296, 311, 0, 674, 1046, 1264, 1396, 1478, 1530, 0, 3263, 5178, 6349, 7084, 7555, 7862, 8065, 0, 17007, 27488, 34139, 38448, 41287, 43184, 44467, 45344, 0, 94828, 155642, 195494, 222044, 239976, 252230, 260690, 266584, 270724]