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.

A109983 Triangle read by rows: T(n, k) (0<=k<=2n) is the number of Delannoy paths of length n, having k steps.

Table of values

n a(n)
0 1
1 0
2 1
3 2
4 0
5 0
6 1
7 6
8 6
9 0
10 0
11 0
12 1
13 12
14 30
15 20
16 0
17 0
18 0
19 0
20 1
21 20
22 90
23 140
24 70
25 0
26 0
27 0
28 0
29 0
30 1
31 30
32 210
33 560
34 630
35 252
36 0
37 0
38 0
39 0
40 0
41 0
42 1
43 42
44 420
45 1680
46 3150
47 2772
48 924
49 0
50 0
51 0
52 0
53 0
54 0
55 0
56 1
57 56
58 756
59 4200
60 11550
61 16632
62 12012
63 3432

List of values

[1, 0, 1, 2, 0, 0, 1, 6, 6, 0, 0, 0, 1, 12, 30, 20, 0, 0, 0, 0, 1, 20, 90, 140, 70, 0, 0, 0, 0, 0, 1, 30, 210, 560, 630, 252, 0, 0, 0, 0, 0, 0, 1, 42, 420, 1680, 3150, 2772, 924, 0, 0, 0, 0, 0, 0, 0, 1, 56, 756, 4200, 11550, 16632, 12012, 3432]