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.

A096793 Triangle read by rows: a(n,k) is the number of Dyck n-paths containing k odd-length ascents.

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 3
11 0
12 10
13 0
14 1
15 0
16 21
17 0
18 20
19 0
20 1
21 12
22 0
23 84
24 0
25 35
26 0
27 1
28 0
29 120
30 0
31 252
32 0
33 56
34 0
35 1
36 55
37 0
38 660
39 0
40 630
41 0
42 84
43 0
44 1
45 0
46 715
47 0
48 2640
49 0
50 1386
51 0
52 120
53 0
54 1
55 273
56 0
57 5005
58 0
59 8580
60 0
61 2772
62 0
63 165
64 0
65 1
66 0
67 4368
68 0
69 25025
70 0
71 24024
72 0
73 5148
74 0
75 220
76 0
77 1

List of values

[1, 0, 1, 1, 0, 1, 0, 4, 0, 1, 3, 0, 10, 0, 1, 0, 21, 0, 20, 0, 1, 12, 0, 84, 0, 35, 0, 1, 0, 120, 0, 252, 0, 56, 0, 1, 55, 0, 660, 0, 630, 0, 84, 0, 1, 0, 715, 0, 2640, 0, 1386, 0, 120, 0, 1, 273, 0, 5005, 0, 8580, 0, 2772, 0, 165, 0, 1, 0, 4368, 0, 25025, 0, 24024, 0, 5148, 0, 220, 0, 1]