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.

A182903 Triangle read by rows: T(n,k) is the number of weighted lattice paths in L_n having k peaks.The members of L_n are paths of weight n that start at (0,0), end on 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. A peak is a (1,1)-step followed by a (1,-1)-step.

Table of values

n a(n)
0 1
1 1
2 2
3 4
4 1
5 9
6 2
7 21
8 5
9 48
10 14
11 1
12 112
13 38
14 3
15 263
16 104
17 9
18 623
19 276
20 31
21 1
22 1484
23 730
24 99
25 4
26 3550
27 1921
28 309
29 14
30 8525
31 5034
32 929
33 56
34 1
35 20537
36 13145
37 2739
38 205
39 5
40 49612
41 34208
42 7956
43 716
44 20
45 120136
46 88780
47 22804
48 2394
49 90
50 1
51 291519
52 229860
53 64650

List of values

[1, 1, 2, 4, 1, 9, 2, 21, 5, 48, 14, 1, 112, 38, 3, 263, 104, 9, 623, 276, 31, 1, 1484, 730, 99, 4, 3550, 1921, 309, 14, 8525, 5034, 929, 56, 1, 20537, 13145, 2739, 205, 5, 49612, 34208, 7956, 716, 20, 120136, 88780, 22804, 2394, 90, 1, 291519, 229860, 64650]

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

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