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.

A110107 Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n, having k return steps to the line y = x from the line y = x+1 or from the line y = x-1 (i.e., E steps from the line y = x+1 to the line y = x or N steps from the line y = x-1 to the line y = x).

Table of values

n a(n)
0 1
1 1
2 2
3 1
4 8
5 4
6 1
7 26
8 28
9 8
10 1
11 88
12 136
13 80
14 16
15 1
16 330
17 600
18 512
19 208
20 32
21 1
22 1360
23 2636
24 2768
25 1648
26 512
27 64
28 1
29 6002
30 11892
31 14024
32 10544
33 4832
34 1216
35 128
36 1
37 27760
38 55376
39 69728
40 60768
41 35712
42 13312
43 2816
44 256
45 1
46 132690
47 265200
48 347072
49 332768
50 231232

List of values

[1, 1, 2, 1, 8, 4, 1, 26, 28, 8, 1, 88, 136, 80, 16, 1, 330, 600, 512, 208, 32, 1, 1360, 2636, 2768, 1648, 512, 64, 1, 6002, 11892, 14024, 10544, 4832, 1216, 128, 1, 27760, 55376, 69728, 60768, 35712, 13312, 2816, 256, 1, 132690, 265200, 347072, 332768, 231232]