A205944 T(n,k) = number of (n+1) X (k+1) 0..3 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.

256, 1776, 1776, 12712, 11028, 12712, 91440, 81864, 81864, 91440, 656272, 620988, 754704, 620988, 656272, 4711264, 4601832, 6705048, 6705048, 4601832, 4711264, 33827496, 34647764, 59081744, 70027468, 59081744, 34647764, 33827496

Offset

1,1

Comments

Table starts

.......256.......1776.......12712........91440.........656272.........4711264

......1776......11028.......81864.......620988........4601832........34647764

.....12712......81864......754704......6705048.......59081744.......519841120

.....91440.....620988.....6705048.....70027468......692354440......6909160028

....656272....4601832....59081744....692354440.....8605131924....103395482496

...4711264...34647764...519841120...6909160028...103395482496...1498787263308

..33827496..258956760..4654724592..72541287824..1315300941940..22850275822056

.242859696.1942182832.41664657416.778680028616.16790996352160.350243656458156

Links

R. H. Hardin, Table of n, a(n) for n = 1..112

Example

Some solutions for n=4, k=3:
..2..0..0..1....3..2..2..0....0..3..3..3....0..1..0..0....0..2..1..0
..3..0..2..0....2..2..2..1....2..3..1..0....1..2..3..0....1..0..0..0
..3..3..0..0....2..2..0..2....2..3..2..1....0..3..2..1....1..2..2..1
..3..3..0..0....1..1..2..2....1..1..0..1....1..0..1..3....1..1..3..2
..2..2..2..1....1..1..1..0....1..1..3..2....1..1..2..2....3..2..0..0

Crossrefs

Sequence in context: A237904 A237899 A238311 * A238306 A205937 A237911

Adjacent sequences: A205941 A205942 A205943 * A205945 A205946 A205947

Keyword

nonn,tabl

Author

R. H. Hardin, Feb 01 2012

Status

approved