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.

A253223 T(n,k) = number of n X k nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 2 and every value within 2 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 0
6 1
7 3
8 1
9 1
10 3
11 6
12 9
13 1
14 9
15 6
16 10
17 25
18 19
19 19
20 25
21 10
22 15
23 49
24 102
25 19
26 102
27 49
28 15
29 21
30 81
31 263
32 268
33 268
34 263
35 81
36 21
37 28
38 121
39 504
40 1249
41 268
42 1249
43 504
44 121
45 28
46 36
47 169
48 825
49 3140
50 3568
51 3568
52 3140
53 825
54 169
55 36
56 45
57 225
58 1226
59 5986
60 16028
61 3568
62 16028

List of values

[0, 0, 0, 1, 0, 1, 3, 1, 1, 3, 6, 9, 1, 9, 6, 10, 25, 19, 19, 25, 10, 15, 49, 102, 19, 102, 49, 15, 21, 81, 263, 268, 268, 263, 81, 21, 28, 121, 504, 1249, 268, 1249, 504, 121, 28, 36, 169, 825, 3140, 3568, 3568, 3140, 825, 169, 36, 45, 225, 1226, 5986, 16028, 3568, 16028]