

A206188


T(n,k) = number of (n+1) X (k+1) 0..3 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.


8



256, 1976, 1976, 15616, 19688, 15616, 124048, 205804, 205804, 124048, 986388, 2410188, 3802676, 2410188, 986388, 7854572, 30417316, 95187756, 95187756, 30417316, 7854572, 62623348, 406202048, 2674444796, 5674969344, 2674444796
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

Table starts
.......256........1976..........15616.............124048................986388
......1976.......19688.........205804............2410188..............30417316
.....15616......205804........3802676...........95187756............2674444796
....124048.....2410188.......95187756.........5674969344..........364197868292
....986388....30417316.....2674444796.......364197868292........51975660472496
...7854572...406202048....78597249508.....23825180259760......7481908870312588
..62623348..5614757320..2345626036136...1565902419680820...1078848431799509828
.499915248.79279051900.70435464744476.103072965502712948.155633082985105845972


LINKS

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


EXAMPLE

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


CROSSREFS

Column 1 is A205363.
Sequence in context: A238058 A235972 A235965 * A205370 A205659 A205363
Adjacent sequences: A206185 A206186 A206187 * A206189 A206190 A206191


KEYWORD

nonn,tabl


AUTHOR

R. H. Hardin, Feb 04 2012


STATUS

approved



