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.

A050157 T(n, k) = S(2n, n, k) for 0<=k<=n and n>=0, where S(p, q, r) is the number of upright paths from (0, 0) to (p, p-q) that do not rise above the line y = x-r.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 5
5 6
6 5
7 14
8 19
9 20
10 14
11 42
12 62
13 69
14 70
15 42
16 132
17 207
18 242
19 251
20 252
21 132
22 429
23 704
24 858
25 912
26 923
27 924
28 429
29 1430
30 2431
31 3068
32 3341
33 3418
34 3431
35 3432
36 1430
37 4862
38 8502
39 11050
40 12310
41 12750
42 12854
43 12869
44 12870

List of values

[1, 1, 2, 2, 5, 6, 5, 14, 19, 20, 14, 42, 62, 69, 70, 42, 132, 207, 242, 251, 252, 132, 429, 704, 858, 912, 923, 924, 429, 1430, 2431, 3068, 3341, 3418, 3431, 3432, 1430, 4862, 8502, 11050, 12310, 12750, 12854, 12869, 12870]