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.

A356359 Square array T(m,n) read by antidiagonals: T(m,n) = number of ways a knight can reach (0, 0) from (m, n) on an infinite chessboard while always decreasing its Manhattan distance from the origin, for nonnegative m, n.

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 0
5 0
6 0
7 1
8 1
9 0
10 2
11 2
12 0
13 2
14 2
15 4
16 2
17 4
18 4
19 2
20 4
21 4
22 6
23 9
24 6
25 9
26 6
27 4
28 12
29 17
30 14
31 17
32 17
33 14
34 17
35 12
36 34
37 35
38 35
39 40
40 36
41 40
42 35
43 35
44 34
45 70
46 74
47 84
48 86
49 90
50 90
51 86
52 84
53 74
54 70
55 148
56 170
57 185
58 195
59 205
60 206
61 205
62 195
63 185
64 170
65 148

List of values

[1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 2, 2, 0, 2, 2, 4, 2, 4, 4, 2, 4, 4, 6, 9, 6, 9, 6, 4, 12, 17, 14, 17, 17, 14, 17, 12, 34, 35, 35, 40, 36, 40, 35, 35, 34, 70, 74, 84, 86, 90, 90, 86, 84, 74, 70, 148, 170, 185, 195, 205, 206, 205, 195, 185, 170, 148]