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.

A238858 Triangle T(n,k) read by rows: T(n,k) is the number of length-n ascent sequences with exactly k descents.

Table of values

n a(n)
0 1
1 1
2 0
3 2
4 0
5 0
6 4
7 1
8 0
9 0
10 8
11 7
12 0
13 0
14 0
15 16
16 33
17 4
18 0
19 0
20 0
21 32
22 131
23 53
24 1
25 0
26 0
27 0
28 64
29 473
30 429
31 48
32 0
33 0
34 0
35 0
36 128
37 1611
38 2748
39 822
40 26
41 0
42 0
43 0
44 0
45 256
46 5281
47 15342
48 9305
49 1048
50 8
51 0
52 0
53 0
54 0
55 512
56 16867
57 78339
58 83590
59 21362
60 937
61 1
62 0
63 0
64 0
65 0
66 1024
67 52905
68 376159
69 647891
70 307660
71 35841
72 594
73 0
74 0
75 0
76 0
77 0

List of values

[1, 1, 0, 2, 0, 0, 4, 1, 0, 0, 8, 7, 0, 0, 0, 16, 33, 4, 0, 0, 0, 32, 131, 53, 1, 0, 0, 0, 64, 473, 429, 48, 0, 0, 0, 0, 128, 1611, 2748, 822, 26, 0, 0, 0, 0, 256, 5281, 15342, 9305, 1048, 8, 0, 0, 0, 0, 512, 16867, 78339, 83590, 21362, 937, 1, 0, 0, 0, 0, 1024, 52905, 376159, 647891, 307660, 35841, 594, 0, 0, 0, 0, 0]