|
%I #5 Mar 31 2012 12:35:54
%S 165979,10698847,666851127,45786104591,3044918926037,211222113324755,
%T 14358430351511371,995346656959800911,68219544649374995309,
%U 4720188015916778912773,324617770000884333815623
%N Number of (n+1)X8 0..2 arrays with each element of every 2X2 subblock being the sum mod 3 of two others
%C Column 7 of A183836
%H R. H. Hardin, <a href="/A183834/b183834.txt">Table of n, a(n) for n = 1..162</a>
%e Some solutions for 3X8
%e ..0..1..0..2..0..2..1..1....0..1..0..1..0..2..1..0....0..1..0..1..0..2..1..1
%e ..2..1..2..1..1..2..0..2....2..1..2..2..1..1..2..2....1..2..1..2..1..2..0..2
%e ..0..2..1..2..0..1..1..2....0..2..1..1..0..2..1..0....0..2..0..1..0..2..1..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 07 2011
| 