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.

A100537 Triangle read by rows: T(n,k) is the number of Dyck n-paths whose first descent has length k.

Table of values

n a(n)
1 1
2 1
3 1
4 3
5 1
6 1
7 9
8 3
9 1
10 1
11 28
12 9
13 3
14 1
15 1
16 90
17 28
18 9
19 3
20 1
21 1
22 297
23 90
24 28
25 9
26 3
27 1
28 1
29 1001
30 297
31 90
32 28
33 9
34 3
35 1
36 1
37 3432
38 1001
39 297
40 90
41 28
42 9
43 3
44 1
45 1
46 11934
47 3432
48 1001
49 297
50 90
51 28
52 9
53 3
54 1
55 1
56 41990
57 11934
58 3432
59 1001
60 297
61 90
62 28
63 9
64 3
65 1
66 1
67 149226
68 41990
69 11934
70 3432
71 1001
72 297
73 90
74 28
75 9
76 3
77 1
78 1

List of values

[1, 1, 1, 3, 1, 1, 9, 3, 1, 1, 28, 9, 3, 1, 1, 90, 28, 9, 3, 1, 1, 297, 90, 28, 9, 3, 1, 1, 1001, 297, 90, 28, 9, 3, 1, 1, 3432, 1001, 297, 90, 28, 9, 3, 1, 1, 11934, 3432, 1001, 297, 90, 28, 9, 3, 1, 1, 41990, 11934, 3432, 1001, 297, 90, 28, 9, 3, 1, 1, 149226, 41990, 11934, 3432, 1001, 297, 90, 28, 9, 3, 1, 1]