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.

A191386 Number of ascents of length 1 in all dispersed Dyck paths of length n (i.e., in all Motzkin paths of length n with no (1,0) steps at positive heights). An ascent is a maximal sequence of consecutive (1,1)-steps.

Table of values

n a(n)
0 0
1 0
2 1
3 2
4 5
5 10
6 23
7 46
8 102
9 204
10 443
11 886
12 1898
13 3796
14 8054
15 16108
16 33932
17 67864
18 142163
19 284326
20 592962
21 1185924
22 2464226
23 4928452
24 10209620
25 20419240
26 42190558
27 84381116
28 173962532
29 347925064
30 715908428
31 1431816856
32 2941192472
33 5882384944
34 12065310083
35 24130620166

List of values

[0, 0, 1, 2, 5, 10, 23, 46, 102, 204, 443, 886, 1898, 3796, 8054, 16108, 33932, 67864, 142163, 284326, 592962, 1185924, 2464226, 4928452, 10209620, 20419240, 42190558, 84381116, 173962532, 347925064, 715908428, 1431816856, 2941192472, 5882384944, 12065310083, 24130620166]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.