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.

A375659 For 0<=k<=n, T(n,k) = the number of Dyck-type lattice paths of length n, starting at the point (0,k), triangle T read by rows.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 3
5 4
6 3
7 6
8 7
9 8
10 6
11 10
12 14
13 15
14 16
15 10
16 20
17 25
18 30
19 31
20 32
21 20
22 35
23 50
24 56
25 62
26 63
27 64
28 35
29 70
30 91
31 112
32 119
33 126
34 127
35 128
36 70
37 126
38 182
39 210
40 238
41 246
42 254
43 255
44 256
45 126
46 252
47 336
48 420
49 456
50 492
51 501
52 510
53 511
54 512
55 252
56 462
57 672
58 792
59 912
60 957
61 1002
62 1012
63 1022
64 1023
65 1024

List of values

[1, 1, 2, 2, 3, 4, 3, 6, 7, 8, 6, 10, 14, 15, 16, 10, 20, 25, 30, 31, 32, 20, 35, 50, 56, 62, 63, 64, 35, 70, 91, 112, 119, 126, 127, 128, 70, 126, 182, 210, 238, 246, 254, 255, 256, 126, 252, 336, 420, 456, 492, 501, 510, 511, 512, 252, 462, 672, 792, 912, 957, 1002, 1012, 1022, 1023, 1024]