|
|
A206197
|
|
T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two
|
|
9
|
|
|
124, 1012, 1012, 8304, 18172, 8304, 68180, 329216, 329216, 68180, 559788, 5972392, 13173864, 5972392, 559788, 4596072, 108363344, 527945420, 527945420, 108363344, 4596072, 37735460, 1966171084, 21162670972, 46704516192, 21162670972
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Table starts
.......124.........1012.............8304...............68180
......1012........18172...........329216.............5972392
......8304.......329216.........13173864...........527945420
.....68180......5972392........527945420.........46704516192
....559788....108363344......21162670972.......4131608458140
...4596072...1966171084.....848327900384.....365468694266436
..37735460..35674679732...34006136221640...32327015669963752
.309822148.647289744976.1363171550451384.2859398851677838652
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4 k=3
..2..2..1..2....1..0..0..0....1..1..2..0....3..0..1..0....2..3..1..1
..0..3..2..0....0..3..2..1....3..2..0..3....1..2..2..1....2..1..3..2
..2..0..3..1....1..0..3..2....0..3..1..0....0..1..0..3....3..2..0..3
..3..2..0..2....3..1..0..3....1..0..2..1....2..2..1..0....0..3..1..0
..0..3..1..0....0..2..1..0....3..2..3..2....0..3..2..1....1..0..2..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|