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.

A251128 T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no 2X2 subblock having the sum of its diagonal elements greater than the maximum of its antidiagonal elements.

Table of values

n a(n)
1 10
2 21
3 21
4 40
5 40
6 40
7 72
8 69
9 69
10 72
11 125
12 117
13 108
14 117
15 125
16 212
17 193
18 173
19 173
20 193
21 212
22 354
23 315
24 272
25 266
26 272
27 315
28 354
29 585
30 510
31 430
32 401
33 401
34 430
35 510
36 585
37 960
38 823
39 680
40 612
41 580
42 612
43 680
44 823
45 960
46 1568
47 1326
48 1080
49 938
50 854
51 854
52 938
53 1080
54 1326

List of values

[10, 21, 21, 40, 40, 40, 72, 69, 69, 72, 125, 117, 108, 117, 125, 212, 193, 173, 173, 193, 212, 354, 315, 272, 266, 272, 315, 354, 585, 510, 430, 401, 401, 430, 510, 585, 960, 823, 680, 612, 580, 612, 680, 823, 960, 1568, 1326, 1080, 938, 854, 854, 938, 1080, 1326]