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.

A109979 Triangle read by rows: T(n,k) (0<=k<=n) is the number of Delannoy paths of length n, having k (1,1)-steps on the line y=x (a Delannoy path of length n is a path from (0,0) to (n,n), consisting of steps (E=1,0), N=(0,1) and D(1,1)).

Table of values

n a(n)
0 1
1 2
2 1
3 8
4 4
5 1
6 36
7 20
8 6
9 1
10 172
11 104
12 36
13 8
14 1
15 852
16 552
17 212
18 56
19 10
20 1
21 4324
22 2968
23 1236
24 368
25 80
26 12
27 1
28 22332
29 16104
30 7164
31 2336
32 580
33 108
34 14
35 1
36 116876
37 87976
38 41372
39 14512
40 3980
41 856
42 140
43 16
44 1
45 618084
46 483192
47 238356
48 88848
49 26372
50 6312
51 1204
52 176

List of values

[1, 2, 1, 8, 4, 1, 36, 20, 6, 1, 172, 104, 36, 8, 1, 852, 552, 212, 56, 10, 1, 4324, 2968, 1236, 368, 80, 12, 1, 22332, 16104, 7164, 2336, 580, 108, 14, 1, 116876, 87976, 41372, 14512, 3980, 856, 140, 16, 1, 618084, 483192, 238356, 88848, 26372, 6312, 1204, 176]