|
%I #5 Mar 31 2012 12:35:54
%S 701191,71897239,7093125423,778858637315,82530377465595,
%T 9166454488125047,995346656959800911,110479563010698341555,
%U 12107676653417111776971,1341155136815090481979787,147545484544758773635797011
%N Number of (n+1)X9 0..2 arrays with each element of every 2X2 subblock being the sum mod 3 of two others
%C Column 8 of A183836
%H R. H. Hardin, <a href="/A183835/b183835.txt">Table of n, a(n) for n = 1..56</a>
%e Some solutions for 3X9
%e ..0..1..0..1..0..1..2..1..1....0..1..0..2..0..2..1..2..0
%e ..1..2..1..2..1..2..1..2..2....2..1..2..1..2..1..2..1..2
%e ..1..0..1..2..0..2..0..1..1....2..0..2..1..2..1..0..1..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 07 2011
| 