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:36:06
%S 322910,25381,46624,148048,310528,414184,571984,801208,1130584,
%T 1842208,3014488,4813744,8147608,13457800,21637048,37154419,62117614,
%U 101085745,172069837,287321977,469126669,793531357,1325629774,2174290240
%N Number of (n+2)X10 0..3 arrays with every 3X3 subblock commuting with each horizontal and vertical neighbor 3X3 subblock
%C Column 8 of A186881
%H R. H. Hardin, <a href="/A186880/b186880.txt">Table of n, a(n) for n = 1..200</a>
%F Empirical: a(n)=2*a(n-1)-a(n-2)+3*a(n-3)-6*a(n-4)+3*a(n-5)+3*a(n-6)-3*a(n-7) for n>16
%e Some solutions for 4X10
%e ..0..0..3..0..0..0..0..0..0..1....0..0..0..0..0..0..0..0..3..0
%e ..1..0..0..3..0..0..0..0..0..1....0..0..0..0..0..0..0..0..0..0
%e ..0..1..0..0..3..0..0..0..0..1....2..0..0..0..0..0..0..0..0..0
%e ..0..0..1..0..0..3..0..0..0..1....3..3..0..0..0..0..0..0..0..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 28 2011