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.

A097885 Triangle read by rows: T(n,k) is the number of Motzkin paths of length n with k valleys (n>=0, 0<=k<=floor(n/2)-1; a valley is a downstep followed by an upstep).

Table of values

n a(n)
0 1
1 1
2 2
3 4
4 8
5 1
6 17
7 4
8 37
9 13
10 1
11 82
12 40
13 5
14 185
15 116
16 21
17 1
18 423
19 326
20 80
21 6
22 978
23 899
24 279
25 31
26 1
27 2283
28 2444
29 924
30 140
31 7
32 5373
33 6578
34 2948
35 568
36 43
37 1
38 12735
39 17576
40 9136
41 2156
42 224
43 8
44 30372
45 46702
46 27690
47 7777
48 1035
49 57
50 1
51 72832
52 123568
53 82453
54 26952
55 4422

List of values

[1, 1, 2, 4, 8, 1, 17, 4, 37, 13, 1, 82, 40, 5, 185, 116, 21, 1, 423, 326, 80, 6, 978, 899, 279, 31, 1, 2283, 2444, 924, 140, 7, 5373, 6578, 2948, 568, 43, 1, 12735, 17576, 9136, 2156, 224, 8, 30372, 46702, 27690, 7777, 1035, 57, 1, 72832, 123568, 82453, 26952, 4422]