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.

A110169 Triangle read by rows: T(n,k) (0<=k<=n) is the number of Delannoy paths of length n that start with exactly k (1,1) steps.

Table of values

n a(n)
0 1
1 2
2 1
3 10
4 2
5 1
6 50
7 10
8 2
9 1
10 258
11 50
12 10
13 2
14 1
15 1362
16 258
17 50
18 10
19 2
20 1
21 7306
22 1362
23 258
24 50
25 10
26 2
27 1
28 39650
29 7306
30 1362
31 258
32 50
33 10
34 2
35 1
36 217090
37 39650
38 7306
39 1362
40 258
41 50
42 10
43 2
44 1
45 1196834
46 217090
47 39650
48 7306
49 1362
50 258
51 50
52 10
53 2
54 1
55 6634890
56 1196834

List of values

[1, 2, 1, 10, 2, 1, 50, 10, 2, 1, 258, 50, 10, 2, 1, 1362, 258, 50, 10, 2, 1, 7306, 1362, 258, 50, 10, 2, 1, 39650, 7306, 1362, 258, 50, 10, 2, 1, 217090, 39650, 7306, 1362, 258, 50, 10, 2, 1, 1196834, 217090, 39650, 7306, 1362, 258, 50, 10, 2, 1, 6634890, 1196834]