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.

A218577 Triangle read by rows: T(n,k) is the number of ascent sequences of length n with maximal element k-1.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 3
6 1
7 1
8 7
9 6
10 1
11 1
12 15
13 25
14 11
15 1
16 1
17 31
18 90
19 74
20 20
21 1
22 1
23 63
24 301
25 402
26 209
27 37
28 1
29 1
30 127
31 966
32 1951
33 1629
34 590
35 70
36 1
37 1
38 255
39 3025
40 8869
41 10839
42 6430
43 1685
44 135
45 1
46 1
47 511
48 9330
49 38720
50 65720
51 56878
52 25313
53 4870
54 264
55 1

List of values

[1, 1, 1, 1, 3, 1, 1, 7, 6, 1, 1, 15, 25, 11, 1, 1, 31, 90, 74, 20, 1, 1, 63, 301, 402, 209, 37, 1, 1, 127, 966, 1951, 1629, 590, 70, 1, 1, 255, 3025, 8869, 10839, 6430, 1685, 135, 1, 1, 511, 9330, 38720, 65720, 56878, 25313, 4870, 264, 1]