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.

A205823 T(n,k) = number of (n+1) X (k+1) 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases.

Table of values

n a(n)
1 24
2 66
3 66
4 180
5 216
6 180
7 492
8 714
9 714
10 492
11 1344
12 2430
13 2880
14 2430
15 1344
16 3672
17 8274
18 12318
19 12318
20 8274
21 3672
22 10032
23 28242
24 53100
25 67944
26 53100
27 28242
28 10032
29 27408
30 96402
31 230532
32 380568
33 380568
34 230532
35 96402
36 27408
37 74880
38 329130
39 1002240

List of values

[24, 66, 66, 180, 216, 180, 492, 714, 714, 492, 1344, 2430, 2880, 2430, 1344, 3672, 8274, 12318, 12318, 8274, 3672, 10032, 28242, 53100, 67944, 53100, 28242, 10032, 27408, 96402, 230532, 380568, 380568, 230532, 96402, 27408, 74880, 329130, 1002240]