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.

A065602 Triangle T(n,k) giving number of hill-free Dyck paths of length 2n and having height of first peak equal to k.

Table of values

n a(n)
2 1
3 1
4 1
5 3
6 2
7 1
8 8
9 6
10 3
11 1
12 24
13 18
14 10
15 4
16 1
17 75
18 57
19 33
20 15
21 5
22 1
23 243
24 186
25 111
26 54
27 21
28 6
29 1
30 808
31 622
32 379
33 193
34 82
35 28
36 7
37 1
38 2742
39 2120
40 1312
41 690
42 311
43 118
44 36
45 8
46 1
47 9458
48 7338
49 4596
50 2476
51 1164
52 474
53 163
54 45
55 9
56 1
57 33062
58 25724
59 16266
60 8928
61 4332
62 1856
63 692
64 218
65 55
66 10
67 1

List of values

[1, 1, 1, 3, 2, 1, 8, 6, 3, 1, 24, 18, 10, 4, 1, 75, 57, 33, 15, 5, 1, 243, 186, 111, 54, 21, 6, 1, 808, 622, 379, 193, 82, 28, 7, 1, 2742, 2120, 1312, 690, 311, 118, 36, 8, 1, 9458, 7338, 4596, 2476, 1164, 474, 163, 45, 9, 1, 33062, 25724, 16266, 8928, 4332, 1856, 692, 218, 55, 10, 1]