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.

A182906 Triangle read by rows: T(n,k) is the number of weighted lattice paths in F[n] having endpoint height k (k<=floor(n/2)). The members of F[n] are paths of weight n that start at (0,0), do not go below the horizontal axis, and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps.

Table of values

n a(n)
0 1
1 1
2 2
3 1
4 4
5 2
6 8
7 5
8 1
9 17
10 12
11 3
12 37
13 28
14 9
15 1
16 82
17 66
18 25
19 4
20 185
21 156
22 66
23 14
24 1
25 423
26 370
27 171
28 44
29 5
30 978
31 882
32 437
33 129
34 20
35 1
36 2283
37 2112
38 1107
39 364
40 70
41 6
42 5373
43 5079
44 2790
45 1000
46 225
47 27
48 1
49 12735
50 12264

List of values

[1, 1, 2, 1, 4, 2, 8, 5, 1, 17, 12, 3, 37, 28, 9, 1, 82, 66, 25, 4, 185, 156, 66, 14, 1, 423, 370, 171, 44, 5, 978, 882, 437, 129, 20, 1, 2283, 2112, 1107, 364, 70, 6, 5373, 5079, 2790, 1000, 225, 27, 1, 12735, 12264]

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

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