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.

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

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 2
7 1
8 4
9 5
10 5
11 1
12 8
13 13
14 15
15 16
16 1
17 16
18 35
19 47
20 56
21 62
22 1
23 32
24 97
25 153
26 204
27 248
28 279
29 1
30 64
31 275
32 515
33 770
34 1030
35 1257
36 1423
37 1
38 128
39 793
40 1785
41 3000
42 4424
43 5869
44 7140
45 8100
46 1
47 256
48 2315
49 6347
50 12026
51 19582
52 28293
53 37058
54 44843
55 50887

List of values

[1, 1, 1, 1, 2, 2, 1, 4, 5, 5, 1, 8, 13, 15, 16, 1, 16, 35, 47, 56, 62, 1, 32, 97, 153, 204, 248, 279, 1, 64, 275, 515, 770, 1030, 1257, 1423, 1, 128, 793, 1785, 3000, 4424, 5869, 7140, 8100, 1, 256, 2315, 6347, 12026, 19582, 28293, 37058, 44843, 50887]