A206685 T(n,k) = number of (n+1) X (k+1) 0..2 arrays with every 2 X 3 or 3 X 2 subblock having an unequal number of clockwise and counterclockwise edge increases.

81, 306, 306, 1404, 1728, 1404, 5352, 9792, 9792, 5352, 24336, 55836, 89022, 55836, 24336, 93696, 317736, 645144, 645144, 317736, 93696, 422016, 1809324, 5747676, 7423464, 5747676, 1809324, 422016, 1639296, 10300608, 41876592, 84549024

Offset

1,1

Comments

Table starts

......81......306.......1404.........5352.........24336...........93696

.....306.....1728.......9792........55836........317736.........1809324

....1404.....9792......89022.......645144.......5747676........41876592

....5352....55836.....645144......7423464......84549024.......965476188

...24336...317736....5747676.....84549024....1533200232.....22293930744

...93696..1809324...41876592....965476188...22293930744....514286765952

..422016.10300608..373903296..11019153780..401233408020..11814420790656

.1639296.58646916.2722587120.125824938768.5846128911096.271625729217060

Links

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

Example

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

Crossrefs

Sequence in context: A237092 A206277 A236018 * A206270 A236011 A206678

Adjacent sequences: A206682 A206683 A206684 * A206686 A206687 A206688

Keyword

nonn,tabl

Author

R. H. Hardin, Feb 11 2012

Status

approved