|
|
A205736
|
|
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 no 2 X 2 subblock having the same number of counterclockwise edge increases as its vertical neighbors.
|
|
15
|
|
|
81, 369, 360, 1764, 978, 1683, 8655, 3888, 3318, 7572, 43155, 17532, 14715, 9198, 35577, 218034, 80916, 80088, 39450, 34674, 160218, 1112664, 376314, 450339, 223560, 191766, 97380, 750426, 5722236, 1756446, 2565900, 1302228, 1421976
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Table starts
......81.....369....1764.....8655.....43155......218034......1112664
.....360.....978....3888....17532.....80916......376314......1756446
....1683....3318...14715....80088....450339.....2565900.....14781282
....7572....9198...39450...223560...1302228.....7713324.....46226928
...35577...34674..191766..1421976..10821462....84974904....677890656
..160218...97380..526680..4116576..33070572...276139080...2333010360
..750426..370008.2500875.25898472.272838012..3069752670..34742828298
.3387924.1053624.6985128.76594212.848995332.10194154164.121870318920
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4, k=3:
..2..1..0..2....0..1..2..1....1..2..2..0....0..1..1..0....2..1..1..1
..1..2..1..0....2..0..1..0....2..1..0..2....1..0..2..1....2..2..2..2
..1..1..1..1....2..0..1..0....2..2..2..2....1..1..1..1....2..2..2..2
..1..1..1..1....1..2..0..2....2..2..2..2....1..1..1..1....2..0..1..2
..2..2..0..0....1..2..2..2....1..1..2..1....1..2..2..2....1..2..2..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|