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.

A110123 Triangle read by rows: T(n,k) is the number of Delannoy paths of length n, having k EE's and NN's crossing the line y = x (i.e., two consecutive E steps from the line y = x+1 to the line y = x-1 or two consecutive N steps from the line y = x-1 to the line y = x+1).

Table of values

n a(n)
0 1
1 3
2 11
3 2
4 45
5 16
6 2
7 197
8 100
9 22
10 2
11 903
12 576
13 174
14 28
15 2
16 4279
17 3206
18 1202
19 266
20 34
21 2
22 20793
23 17568
24 7732
25 2128
26 376
27 40
28 2
29 103049
30 95592
31 47676
32 15452
33 3408
34 504
35 46
36 2
37 518859
38 518720
39 286156
40 105528
41 27500
42 5096
43 650
44 52
45 2
46 2646723
47 2813514

List of values

[1, 3, 11, 2, 45, 16, 2, 197, 100, 22, 2, 903, 576, 174, 28, 2, 4279, 3206, 1202, 266, 34, 2, 20793, 17568, 7732, 2128, 376, 40, 2, 103049, 95592, 47676, 15452, 3408, 504, 46, 2, 518859, 518720, 286156, 105528, 27500, 5096, 650, 52, 2, 2646723, 2813514]