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.

A182885 Triangle read by rows: T(n,k) is the number of weighted lattice paths in L_n having k (1,0)-steps of weight 2. These are paths 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; 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 1
3 1
4 3
5 2
6 7
7 3
8 1
9 13
10 10
11 3
12 27
13 29
14 6
15 1
16 61
17 66
18 22
19 4
20 133
21 157
22 75
23 10
24 1
25 287
26 398
27 201
28 40
29 5
30 633
31 975
32 538
33 155
34 15
35 1
36 1407
37 2334
38 1506
39 476
40 65
41 6
42 3121
43 5631
44 4077
45 1414
46 280
47 21
48 1
49 6943
50 13602
51 10695
52 4320
53 966
54 98
55 7
56 15517
57 32623
58 27966
59 12765
60 3150
61 462
62 28
63 1

List of values

[1, 1, 1, 1, 3, 2, 7, 3, 1, 13, 10, 3, 27, 29, 6, 1, 61, 66, 22, 4, 133, 157, 75, 10, 1, 287, 398, 201, 40, 5, 633, 975, 538, 155, 15, 1, 1407, 2334, 1506, 476, 65, 6, 3121, 5631, 4077, 1414, 280, 21, 1, 6943, 13602, 10695, 4320, 966, 98, 7, 15517, 32623, 27966, 12765, 3150, 462, 28, 1]

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

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