Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
A205465
Number of (n+1)X8 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock differing from each horizontal or vertical neighbor
0
92062852, 52550629576, 44457471151176, 37682835967710128, 31646417127980445980, 26629795409510135065440
OFFSET
1,1
COMMENTS
Column 7 of A205466
EXAMPLE
Some solutions for n=4
..1..2..3..2..0..3..2..3....3..3..3..2..0..2..2..0....2..0..2..0..0..0..3..3
..1..2..1..1..0..2..3..3....1..1..0..0..1..1..3..3....2..2..0..0..0..3..0..3
..3..1..1..1..2..3..3..3....1..1..2..1..1..1..1..0....1..0..0..0..3..2..1..0
..0..0..2..1..3..3..3..0....3..0..0..0..2..1..1..0....1..2..1..1..0..0..2..2
..2..1..1..2..2..0..3..1....2..3..0..0..0..2..3..1....1..3..0..3..3..1..1..0
CROSSREFS
Sequence in context: A034643 A186051 A205665 * A117624 A147527 A293244
KEYWORD
nonn
AUTHOR
R. H. Hardin Jan 27 2012
STATUS
approved