Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Mar 31 2012 12:37:05
%S 22161076,6825854177,2919626746607,1671381122482219,
%T 1006455738823529884,675088076670736108423,426069670428664499911552,
%U 290434049426815952928276365,184112065386008056140687767286
%N Number of (n+1)X8 0..3 arrays with the number of rightwards and downwards edge increases in each 2X2 subblock equal to the number in all its horizontal and vertical neighbors
%C Column 7 of A205097
%H R. H. Hardin, <a href="/A205096/b205096.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=3
%e ..0..3..2..3..3..0..0..2....3..2..3..3..2..2..0..0....2..2..0..2..0..2..2..0
%e ..0..0..1..1..2..2..0..0....0..1..1..3..3..2..1..0....0..3..1..0..1..0..3..1
%e ..1..0..0..1..1..2..1..0....0..0..1..1..3..3..1..1....2..2..3..1..1..2..0..2
%e ..1..1..0..0..1..0..1..1....3..0..0..1..1..2..2..1....0..3..0..2..2..0..3..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 22 2012