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.

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

Table of values

n a(n)
2 1
3 3
4 2
5 10
6 7
7 6
8 37
9 27
10 23
11 21
12 151
13 114
14 97
15 88
16 83
17 674
18 523
19 446
20 403
21 378
22 363
23 3263
24 2589
25 2217
26 1999
27 1867
28 1785
29 1733
30 17007
31 13744
32 11829
33 10658
34 9923
35 9452
36 9145
37 8942
38 94828
39 77821
40 67340
41 60689
42 56380
43 53541
44 51644
45 50361
46 49484
47 562595

List of values

[1, 3, 2, 10, 7, 6, 37, 27, 23, 21, 151, 114, 97, 88, 83, 674, 523, 446, 403, 378, 363, 3263, 2589, 2217, 1999, 1867, 1785, 1733, 17007, 13744, 11829, 10658, 9923, 9452, 9145, 8942, 94828, 77821, 67340, 60689, 56380, 53541, 51644, 50361, 49484, 562595]