The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #7 Oct 09 2015 22:34:13
%S 360,978,3888,17532,80916,376314,1756446,8212662,38432652,179925948,
%T 842504430,3945403368,18476947170,86532335682,405257580870,
%U 1897955537136,8888775949212,41629230515718,194964278279712,913086294849486
%N Number of 3X(n+1) 0..2 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.
%C Row 2 of A205736.
%H R. H. Hardin, <a href="/A205738/b205738.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 6*a(n-1) -2*a(n-2) -21*a(n-3) +a(n-4) +25*a(n-5) +14*a(n-6) -4*a(n-8) -2*a(n-9) for n>13.
%e Some solutions for n=4:
%e ..1..1..2..1..0....0..0..0..2..0....2..1..1..0..1....2..2..1..2..1
%e ..0..2..1..2..1....1..2..0..2..0....0..1..2..0..1....0..2..1..2..0
%e ..0..1..1..1..1....0..0..1..0..1....0..2..1..1..0....1..0..2..1..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 30 2012