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.

A110098 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 (i.e., E steps from the line y=x+1 to the line y = x).

Table of values

n a(n)
0 1
1 2
2 1
3 6
4 6
5 1
6 22
7 30
8 10
9 1
10 90
11 146
12 70
13 14
14 1
15 394
16 714
17 430
18 126
19 18
20 1
21 1806
22 3534
23 2490
24 938
25 198
26 22
27 1
28 8558
29 17718
30 14002
31 6314
32 1734
33 286
34 26
35 1
36 41586
37 89898
38 77550
39 40054
40 13338
41 2882
42 390
43 30
44 1
45 206098
46 461010
47 426150
48 244790
49 94554
50 24970
51 4446
52 510
53 34
54 1

List of values

[1, 2, 1, 6, 6, 1, 22, 30, 10, 1, 90, 146, 70, 14, 1, 394, 714, 430, 126, 18, 1, 1806, 3534, 2490, 938, 198, 22, 1, 8558, 17718, 14002, 6314, 1734, 286, 26, 1, 41586, 89898, 77550, 40054, 13338, 2882, 390, 30, 1, 206098, 461010, 426150, 244790, 94554, 24970, 4446, 510, 34, 1]