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.

A110171 Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n that start with exactly k (0,1) steps (or, equivalently, with exactly k (1,0) steps).

Table of values

n a(n)
0 1
1 2
2 1
3 8
4 4
5 1
6 38
7 18
8 6
9 1
10 192
11 88
12 32
13 8
14 1
15 1002
16 450
17 170
18 50
19 10
20 1
21 5336
22 2364
23 912
24 292
25 72
26 12
27 1
28 28814
29 12642
30 4942
31 1666
32 462
33 98
34 14
35 1
36 157184
37 68464
38 27008
39 9424
40 2816
41 688
42 128
43 16
44 1
45 864146
46 374274
47 148626
48 53154
49 16722
50 4482
51 978
52 162
53 18
54 1

List of values

[1, 2, 1, 8, 4, 1, 38, 18, 6, 1, 192, 88, 32, 8, 1, 1002, 450, 170, 50, 10, 1, 5336, 2364, 912, 292, 72, 12, 1, 28814, 12642, 4942, 1666, 462, 98, 14, 1, 157184, 68464, 27008, 9424, 2816, 688, 128, 16, 1, 864146, 374274, 148626, 53154, 16722, 4482, 978, 162, 18, 1]