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.

A110121 Triangle read by rows: T(n,k) (0 <= k <= floor(n/2)) is the number of Delannoy paths of length n, having k EE's crossing the line y = x (i.e., two consecutive E steps from the line y = x+1 to the line y = x-1).

Table of values

n a(n)
0 1
1 3
2 12
3 1
4 53
5 10
6 247
7 73
8 1
9 1192
10 474
11 17
12 5897
13 2908
14 183
15 1
16 29723
17 17290
18 1602
19 24
20 152020
21 100891
22 12475
23 342
24 1
25 786733
26 581814
27 90205
28 3780
29 31
30 4111295
31 3329507
32 620243
33 35857
34 550
35 1
36 21661168
37 18956564
38 4114406
39 307192
40 7351
41 38

List of values

[1, 3, 12, 1, 53, 10, 247, 73, 1, 1192, 474, 17, 5897, 2908, 183, 1, 29723, 17290, 1602, 24, 152020, 100891, 12475, 342, 1, 786733, 581814, 90205, 3780, 31, 4111295, 3329507, 620243, 35857, 550, 1, 21661168, 18956564, 4114406, 307192, 7351, 38]