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.

A218581 Triangle read by rows: T(n,k) is the number of ascent sequences of length n with last occurrence of the maximal value at position k-1.

Table of values

n a(n)
1 1
2 0
3 2
4 0
5 1
6 4
7 0
8 1
9 4
10 10
11 0
12 1
13 6
14 15
15 31
16 0
17 1
18 10
19 29
20 62
21 115
22 0
23 1
24 18
25 63
26 148
27 288
28 496
29 0
30 1
31 34
32 149
33 392
34 826
35 1496
36 2437
37 0
38 1
39 66
40 375
41 1120
42 2592
43 5036
44 8615
45 13435
46 0
47 1
48 130
49 989
50 3392
51 8698
52 18332
53 33391
54 54548
55 82127

List of values

[1, 0, 2, 0, 1, 4, 0, 1, 4, 10, 0, 1, 6, 15, 31, 0, 1, 10, 29, 62, 115, 0, 1, 18, 63, 148, 288, 496, 0, 1, 34, 149, 392, 826, 1496, 2437, 0, 1, 66, 375, 1120, 2592, 5036, 8615, 13435, 0, 1, 130, 989, 3392, 8698, 18332, 33391, 54548, 82127]