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.

A110221 Triangle read by rows: T(n,k) (0<=k<=floor(n/2)) is the number of Delannoy paths of length n, having k ED's.

Table of values

n a(n)
0 1
1 3
2 11
3 2
4 45
5 18
6 195
7 120
8 6
9 873
10 720
11 90
12 3989
13 4110
14 870
15 20
16 18483
17 22806
18 6930
19 420
20 86515
21 124264
22 49560
23 5320
24 70
25 408105
26 668520
27 331128
28 52920
29 1890
30 1936881
31 3562830
32 2111760
33 456120
34 29610
35 252
36 9238023
37 18850590
38 13020480
39 3575880

List of values

[1, 3, 11, 2, 45, 18, 195, 120, 6, 873, 720, 90, 3989, 4110, 870, 20, 18483, 22806, 6930, 420, 86515, 124264, 49560, 5320, 70, 408105, 668520, 331128, 52920, 1890, 1936881, 3562830, 2111760, 456120, 29610, 252, 9238023, 18850590, 13020480, 3575880]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.