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.

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

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

List of values

[1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 4, 4, 4, 2, 3, 9, 12, 12, 9, 3, 1, 2, 3, 4, 3, 2, 1, 3, 9, 15, 21, 21, 15, 9, 3, 6, 24, 48, 72, 84, 72, 48, 24, 6, 1, 3, 6, 10, 12, 12, 10, 6, 3, 1, 4, 16, 36, 64, 88, 96, 88, 64, 36, 16, 4, 10, 50, 130, 250, 380, 460, 460, 380, 250, 130, 50, 10, 1, 4, 10, 20, 31, 40, 44, 40, 31, 20, 10, 4, 1]