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.

A190167 Triangle read by rows: T(n,k) is the number of peakless Motzkin paths of length n having a total of k (1,0)-steps at levels 1,3,5,... .

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 2
7 1
8 2
9 3
10 2
11 1
12 4
13 6
14 4
15 2
16 1
17 7
18 12
19 10
20 5
21 2
22 1
23 12
24 24
25 23
26 14
27 6
28 2
29 1
30 21
31 48
32 52
33 36
34 18
35 7
36 2
37 1
38 38
39 96
40 115
41 90
42 51
43 22
44 8
45 2
46 1
47 70
48 193
49 254
50 217
51 138
52 68
53 26
54 9
55 2
56 1
57 130
58 388
59 559
60 522
61 358
62 196
63 87
64 30
65 10
66 2
67 1
68 243
69 782
70 1220
71 1240
72 926
73 542
74 264
75 108
76 34
77 11
78 2
79 1

List of values

[1, 1, 1, 1, 1, 1, 2, 1, 2, 3, 2, 1, 4, 6, 4, 2, 1, 7, 12, 10, 5, 2, 1, 12, 24, 23, 14, 6, 2, 1, 21, 48, 52, 36, 18, 7, 2, 1, 38, 96, 115, 90, 51, 22, 8, 2, 1, 70, 193, 254, 217, 138, 68, 26, 9, 2, 1, 130, 388, 559, 522, 358, 196, 87, 30, 10, 2, 1, 243, 782, 1220, 1240, 926, 542, 264, 108, 34, 11, 2, 1]