|
%I #4 Mar 03 2014 16:08:30
%S 8,42,336,1506,11440,48538,359456,1502622,10971288,45750856,331213056,
%T 1382740252,9956765976,41644596642,298827741680,1252006016638,
%U 8963172170592,37604588665246,268792589572384,1128862873230946
%N Number of nX5 0..2 arrays with no element equal to the sum modulo 3 of elements to its left or elements above it
%C Column 5 of A238726
%H R. H. Hardin, <a href="/A238723/b238723.txt">Table of n, a(n) for n = 1..220</a>
%F Empirical: a(n) = 167*a(n-2) -12737*a(n-4) +590522*a(n-6) -18674960*a(n-8) +428232709*a(n-10) -7384832953*a(n-12) +97981999331*a(n-14) -1014383126841*a(n-16) +8257937387592*a(n-18) -53002256526176*a(n-20) +267655608403835*a(n-22) -1056157718233604*a(n-24) +3216196113264380*a(n-26) -7411332048725488*a(n-28) +12543993016224416*a(n-30) -14892794784221696*a(n-32) +11503438838397440*a(n-34) -5030303892805632*a(n-36) +890642713919488*a(n-38)
%e Some solutions for n=5
%e ..1..2..1..2..1....2..1..1..2..1....1..2..1..2..2....2..1..1..2..2
%e ..2..0..0..1..2....1..0..2..1..2....2..0..0..1..1....1..0..2..1..0
%e ..2..0..0..1..2....1..0..2..1..2....1..0..0..2..1....1..2..2..1..1
%e ..1..0..2..2..1....2..0..1..2..0....2..1..2..1..2....2..1..1..2..2
%e ..2..0..1..1..2....1..0..2..2..1....1..2..1..2..1....1..2..1..2..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Mar 03 2014
| 