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

81, 60, 60, 162, 246, 162, 486, 1122, 1122, 486, 1458, 5118, 7812, 5118, 1458, 4374, 23346, 54450, 54450, 23346, 4374, 13122, 106494, 379602, 580986, 379602, 106494, 13122, 39366, 485778, 2646540, 6204438, 6204438, 2646540, 485778, 39366, 118098

Offset

1,1

Comments

Table starts

....81......60.......162........486.........1458...........4374

....60.....246......1122.......5118........23346.........106494

...162....1122......7812......54450.......379602........2646540

...486....5118.....54450.....580986......6204438.......66274542

..1458...23346....379602....6204438....101596896.....1664748270

..4374..106494...2646540...66274542...1664748270....41869995708

.13122..485778..18451530..707982258..27284864220..1053631126386

.39366.2215902.128643282.7563227466.447232269654.26519876081106

Links

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

Example

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

Crossrefs

Sequence in context: A147674 A033401 A143756 * A206143 A087410 A177842

Adjacent sequences: A206147 A206148 A206149 * A206151 A206152 A206153

Keyword

nonn,tabl

Author

R. H. Hardin, Feb 04 2012

Status

approved