|
|
A206085
|
|
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 one
|
|
9
|
|
|
124, 960, 960, 7308, 13672, 7308, 55864, 187144, 187144, 55864, 426596, 2567488, 4379116, 2567488, 426596, 3258496, 35195768, 101839532, 101839532, 35195768, 3258496, 24887884, 482548752, 2359157212, 3974151636, 2359157212, 482548752
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Table starts
.......124.........960...........7308............55864..............426596
.......960.......13672.........187144..........2567488............35195768
......7308......187144........4379116........101839532..........2359157212
.....55864.....2567488......101839532.......3974151636........153755370824
....426596....35195768.....2359157212.....153755370824.......9872088702792
...3258496...482548752....54618168204....5940013254736.....632007271023440
..24887884..6615795040..1264215787012..229359164378264...40413288246801524
.190093096.90703800392.29260651415912.8855443936590808.2583686563767911744
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4 k=3
..2..2..0..1....1..1..2..2....0..0..0..0....2..0..2..2....3..2..0..1
..3..2..0..0....1..2..2..0....3..0..1..1....3..0..0..0....0..2..0..1
..0..0..0..1....1..1..2..3....3..0..1..0....3..3..0..2....2..2..0..0
..1..3..0..0....3..1..2..2....3..0..0..0....3..0..0..2....1..2..2..0
..3..3..3..0....1..1..1..1....3..3..0..1....3..0..1..1....2..2..3..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|