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.

A179618 T(n,k) = Half the number of (n+1) X (k+1) 0..2 arrays with every 2 X 2 subblock diagonal sum differing from its antidiagonal sum by more than 2.

Table of values

n a(n)
1 5
2 11
3 11
4 21
5 35
6 21
7 43
8 93
9 93
10 43
11 85
12 269
13 314
14 269
15 85
16 171
17 747
18 1213
19 1213
20 747
21 171
22 341
23 2115
24 4375
25 6427
26 4375
27 2115
28 341
29 683
30 5933
31 16334
32 31387
33 31387
34 16334
35 5933
36 683
37 1365
38 16717
39 59925
40 159651
41 202841
42 159651
43 59925
44 16717
45 1365
46 2731

List of values

[5, 11, 11, 21, 35, 21, 43, 93, 93, 43, 85, 269, 314, 269, 85, 171, 747, 1213, 1213, 747, 171, 341, 2115, 4375, 6427, 4375, 2115, 341, 683, 5933, 16334, 31387, 31387, 16334, 5933, 683, 1365, 16717, 59925, 159651, 202841, 159651, 59925, 16717, 1365, 2731]