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.

A205193 T(n,k) = Number of (n+1) X (k+1) 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock differing from each horizontal or vertical neighbor.

Table of values

n a(n)
1 16
2 24
3 24
4 48
5 40
6 48
7 72
8 64
9 64
10 72
11 144
12 104
13 124
14 104
15 144
16 216
17 168
18 160
19 160
20 168
21 216
22 432
23 272
24 292
25 256
26 292
27 272
28 432
29 648
30 440
31 384
32 384
33 384
34 384
35 440
36 648
37 1296
38 712
39 708
40 576
41 736
42 576
43 708
44 712
45 1296
46 1944
47 1152
48 928
49 864
50 896
51 896
52 864
53 928
54 1152

List of values

[16, 24, 24, 48, 40, 48, 72, 64, 64, 72, 144, 104, 124, 104, 144, 216, 168, 160, 160, 168, 216, 432, 272, 292, 256, 292, 272, 432, 648, 440, 384, 384, 384, 384, 440, 648, 1296, 712, 708, 576, 736, 576, 708, 712, 1296, 1944, 1152, 928, 864, 896, 896, 864, 928, 1152]