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.

A330601 Array T read by antidiagonals: T(m,n) is the number of lattice walks from (0,0) to (m,n) using one step from {(3,0), (2,1), (1,2), (0,3)} and all other steps from {(1,0), (0,1)}.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
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 4
22 16
23 28
24 32
25 28
26 16
27 4
28 5
29 25
30 55
31 75
32 75
33 55
34 25
35 5
36 6
37 36
38 96
39 156
40 180
41 156
42 96
43 36
44 6
45 7
46 49
47 154
48 294
49 392
50 392
51 294
52 154
53 49
54 7
55 8
56 64
57 232
58 512
59 784
60 896
61 784
62 512
63 232
64 64
65 8
66 9
67 81
68 333
69 837
70 1458
71 1890
72 1890
73 1458
74 837
75 333
76 81
77 9

List of values

[0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 4, 4, 4, 2, 3, 9, 12, 12, 9, 3, 4, 16, 28, 32, 28, 16, 4, 5, 25, 55, 75, 75, 55, 25, 5, 6, 36, 96, 156, 180, 156, 96, 36, 6, 7, 49, 154, 294, 392, 392, 294, 154, 49, 7, 8, 64, 232, 512, 784, 896, 784, 512, 232, 64, 8, 9, 81, 333, 837, 1458, 1890, 1890, 1458, 837, 333, 81, 9]