A205917 T(n,k) = number of (n+1) X (k+1) 0..2 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and the same number of counterclockwise edge increases as its vertical neighbors.

81, 369, 369, 1764, 1791, 1764, 8655, 9831, 9831, 8655, 43155, 60108, 87918, 60108, 43155, 218034, 387267, 875760, 875760, 387267, 218034, 1112664, 2554848, 8986929, 14150391, 8986929, 2554848, 1112664, 5722236, 17051166, 93488811, 231526056

Offset

1,1

Comments

Table starts

......81.......369........1764..........8655...........43155............218034

.....369......1791........9831.........60108..........387267...........2554848

....1764......9831.......87918........875760.........8986929..........93488811

....8655.....60108......875760......14150391.......231526056........3820547082

...43155....387267.....8986929.....231526056......6011669886......157611325827

..218034...2554848....93488811....3820547082....157611325827.....6566654061039

.1112664..17051166...976932162...63265158237...4140502079766...274342874332980

.5722236.114537918.10250633343.1050303618804.109077858375072.11488530154756449

Links

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

Example

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

Crossrefs

Column 1 is A205737.

Sequence in context: A017378 A205736 A237850 * A205909 A237843 A205737

Adjacent sequences: A205914 A205915 A205916 * A205918 A205919 A205920

Keyword

nonn,tabl

Author

R. H. Hardin, Feb 01 2012

Status

approved