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.

A114711 Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n and having k weak ascents (1 <= k <= ceiling(n/3)).

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 1
6 5
7 3
8 8
9 9
10 13
11 22
12 2
13 21
14 51
15 10
16 34
17 111
18 40
19 55
20 233
21 130
22 5
23 89
24 474
25 380
26 35
27 144
28 942
29 1022
30 175
31 233
32 1836
33 2590
34 700
35 14
36 377
37 3522
38 6260
39 2450
40 126
41 610
42 6666
43 14570
44 7770
45 756
46 987
47 12473
48 32870
49 22890
50 3570
51 42
52 1597
53 23109
54 72244

List of values

[1, 1, 2, 3, 1, 5, 3, 8, 9, 13, 22, 2, 21, 51, 10, 34, 111, 40, 55, 233, 130, 5, 89, 474, 380, 35, 144, 942, 1022, 175, 233, 1836, 2590, 700, 14, 377, 3522, 6260, 2450, 126, 610, 6666, 14570, 7770, 756, 987, 12473, 32870, 22890, 3570, 42, 1597, 23109, 72244]