|
|
A205656
|
|
Number of (n+1)X6 0..3 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.
|
|
1
|
|
|
986388, 7919128, 57716364, 639426584, 7578064080, 88431310744, 1092079388028, 13465529402424, 172083987692176, 2147939536254768, 27674881330828524, 347439396017429976, 4493096435992372036, 56517849184020808768
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4:
..1..2..3..1..1..2....2..0..2..2..2..3....2..0..2..1..0..0....0..1..3..1..0..3
..3..0..2..0..3..2....2..0..2..1..2..3....0..1..0..3..2..1....1..0..1..2..1..0
..3..0..2..0..1..2....0..1..3..2..1..2....1..1..0..3..3..3....1..0..1..2..1..0
..1..2..1..2..1..0....0..1..3..2..1..2....2..3..0..1..2..3....2..1..2..1..2..1
..1..1..1..2..3..3....3..0..1..3..2..3....0..3..2..1..3..2....1..1..2..1..2..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|