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.

A218757 Triangle read by rows: T(n,k) is the number of length-n ascent sequences without flat steps, containing k zeros.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 0
6 0
7 1
8 1
9 0
10 0
11 2
12 3
13 0
14 0
15 0
16 5
17 9
18 2
19 0
20 0
21 0
22 16
23 32
24 13
25 0
26 0
27 0
28 0
29 61
30 132
31 72
32 6
33 0
34 0
35 0
36 0
37 271
38 623
39 409
40 69
41 0
42 0
43 0
44 0
45 0
46 1372
47 3314
48 2480
49 605
50 24
51 0
52 0
53 0
54 0
55 0
56 7795
57 19628
58 16222
59 5016
60 432
61 0
62 0
63 0
64 0
65 0
66 0
67 49093
68 128126
69 114594
70 41955
71 5498
72 120
73 0
74 0
75 0
76 0
77 0

List of values

[1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 2, 3, 0, 0, 0, 5, 9, 2, 0, 0, 0, 16, 32, 13, 0, 0, 0, 0, 61, 132, 72, 6, 0, 0, 0, 0, 271, 623, 409, 69, 0, 0, 0, 0, 0, 1372, 3314, 2480, 605, 24, 0, 0, 0, 0, 0, 7795, 19628, 16222, 5016, 432, 0, 0, 0, 0, 0, 0, 49093, 128126, 114594, 41955, 5498, 120, 0, 0, 0, 0, 0]