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.

A126222 Triangle read by rows: T(n,k) is the number of 2-Motzkin paths (i.e., Motzkin paths with blue and red level steps) without red level steps on the x-axis, having length n and k level steps (0 <= k <= n).

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 0
5 1
6 0
7 4
8 0
9 1
10 2
11 0
12 11
13 0
14 1
15 0
16 15
17 0
18 26
19 0
20 1
21 5
22 0
23 69
24 0
25 57
26 0
27 1
28 0
29 56
30 0
31 252
32 0
33 120
34 0
35 1
36 14
37 0
38 364
39 0
40 804
41 0
42 247
43 0
44 1
45 0
46 210
47 0
48 1800
49 0
50 2349
51 0
52 502
53 0
54 1
55 42
56 0
57 1770
58 0
59 7515
60 0
61 6455
62 0
63 1013
64 0
65 1
66 0
67 792
68 0
69 11055
70 0
71 27940
72 0
73 16962
74 0

List of values

[1, 0, 1, 1, 0, 1, 0, 4, 0, 1, 2, 0, 11, 0, 1, 0, 15, 0, 26, 0, 1, 5, 0, 69, 0, 57, 0, 1, 0, 56, 0, 252, 0, 120, 0, 1, 14, 0, 364, 0, 804, 0, 247, 0, 1, 0, 210, 0, 1800, 0, 2349, 0, 502, 0, 1, 42, 0, 1770, 0, 7515, 0, 6455, 0, 1013, 0, 1, 0, 792, 0, 11055, 0, 27940, 0, 16962, 0]