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.

A186128 T(n,k) = Number of (n+1) X (k+1) binary arrays with every 2 X 2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2 X 2 subblock diagonal sum less antidiagonal sum.

Table of values

n a(n)
1 0
2 14
3 14
4 18
5 38
6 18
7 50
8 94
9 94
10 50
11 74
12 254
13 262
14 254
15 74
16 182
17 682
18 946
19 946
20 682
21 182
22 298
23 1878
24 2978
25 4254
26 2978
27 1878
28 298
29 678
30 5214
31 10502
32 17794
33 17794
34 10502
35 5214
36 678
37 1186
38 14606
39 34678
40 79782
41 90054
42 79782
43 34678
44 14606
45 1186
46 2566
47 41138

List of values

[0, 14, 14, 18, 38, 18, 50, 94, 94, 50, 74, 254, 262, 254, 74, 182, 682, 946, 946, 682, 182, 298, 1878, 2978, 4254, 2978, 1878, 298, 678, 5214, 10502, 17794, 17794, 10502, 5214, 678, 1186, 14606, 34678, 79782, 90054, 79782, 34678, 14606, 1186, 2566, 41138]