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.

A292436 Array T read by antidiagonals: T(m,n) is the number of lattice walks of minimal length from (0,0) to (m,n) using steps in directions from {(1,0), (0,1), (2,1), (1,2)}.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 1
6 1
7 1
8 1
9 1
10 1
11 2
12 4
13 2
14 1
15 1
16 3
17 9
18 9
19 3
20 1
21 1
22 4
23 1
24 2
25 1
26 4
27 1
28 1
29 5
30 3
31 9
32 9
33 3
34 5
35 1
36 1
37 6
38 6
39 24
40 36
41 24
42 6
43 6
44 1
45 1
46 7
47 10
48 1
49 3
50 3
51 1
52 10
53 7
54 1
55 1
56 8
57 15
58 4
59 16
60 24
61 16
62 4
63 15
64 8
65 1
66 1
67 9
68 21
69 10
70 50
71 100
72 100
73 50
74 10
75 21
76 9
77 1
78 1
79 10
80 28
81 20
82 1
83 4
84 6
85 4
86 1
87 20
88 28
89 10
90 1

List of values

[1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 4, 2, 1, 1, 3, 9, 9, 3, 1, 1, 4, 1, 2, 1, 4, 1, 1, 5, 3, 9, 9, 3, 5, 1, 1, 6, 6, 24, 36, 24, 6, 6, 1, 1, 7, 10, 1, 3, 3, 1, 10, 7, 1, 1, 8, 15, 4, 16, 24, 16, 4, 15, 8, 1, 1, 9, 21, 10, 50, 100, 100, 50, 10, 21, 9, 1, 1, 10, 28, 20, 1, 4, 6, 4, 1, 20, 28, 10, 1]