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.

A102405 Triangle read by rows: T(n,k) is number of Dyck paths of semilength n having k ascents of length 1 that start at an odd level.

Table of values

n a(n)
0 1
1 1
2 2
3 4
4 1
5 10
6 3
7 1
8 26
9 12
10 3
11 1
12 72
13 41
14 15
15 3
16 1
17 206
18 143
19 58
20 18
21 3
22 1
23 606
24 492
25 231
26 76
27 21
28 3
29 1
30 1820
31 1693
32 891
33 335
34 95
35 24
36 3
37 1
38 5558
39 5823
40 3403
41 1411
42 455
43 115
44 27
45 3
46 1
47 17206
48 20040
49 12870
50 5848
51 2061
52 591
53 136
54 30
55 3
56 1
57 53872
58 69033
59 48318
60 23858
61 9143
62 2850
63 743
64 158
65 33
66 3
67 1

List of values

[1, 1, 2, 4, 1, 10, 3, 1, 26, 12, 3, 1, 72, 41, 15, 3, 1, 206, 143, 58, 18, 3, 1, 606, 492, 231, 76, 21, 3, 1, 1820, 1693, 891, 335, 95, 24, 3, 1, 5558, 5823, 3403, 1411, 455, 115, 27, 3, 1, 17206, 20040, 12870, 5848, 2061, 591, 136, 30, 3, 1, 53872, 69033, 48318, 23858, 9143, 2850, 743, 158, 33, 3, 1]