|
%I #5 Feb 19 2016 09:48:52
%S 432,103488,15024096,1856325000,211625837280,22984646281176,
%T 2416707037884480,248267055360211392,25062609875880382656,
%U 2495854741014485439624,245851383088389214772304
%N Number of nX5 0..3 arrays with some element plus some horizontally or vertically adjacent neighbor totalling three exactly once.
%C Column 5 of A269097.
%H R. H. Hardin, <a href="/A269094/b269094.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 236*a(n-1) -19546*a(n-2) +707906*a(n-3) -13261621*a(n-4) +137719076*a(n-5) -784626841*a(n-6) +2025590366*a(n-7) +1091882414*a(n-8) -18874661724*a(n-9) +33829878231*a(n-10) +10605114324*a(n-11) -91783964484*a(n-12) +94503314304*a(n-13) -30762353664*a(n-14) for n>15
%e Some solutions for n=2
%e ..3..3..2..2..2. .0..1..0..2..2. .0..0..1..3..2. .2..2..0..1..3
%e ..1..3..0..2..2. .1..1..3..2..0. .1..3..3..1..3. .3..2..1..1..3
%Y Cf. A269097.
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 19 2016
| 