Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #4 Apr 16 2018 11:56:10
%S 4,32,154,786,3924,19868,100161,505908,2554201,12898093,65130456,
%T 328890172,1660800969,8386586118,42349950959,213855666444,
%U 1079912639341,5453263882696,27537493309346,139056822182155,702198983497508
%N Number of 3Xn 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
%C Row 3 of A302965.
%H R. H. Hardin, <a href="/A302966/b302966.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 3*a(n-1) +15*a(n-2) -11*a(n-3) -64*a(n-4) -10*a(n-5) +73*a(n-6) +15*a(n-7) -7*a(n-8) +4*a(n-9) -30*a(n-10) -9*a(n-11) +8*a(n-12) for n>13
%e Some solutions for n=5
%e ..0..1..0..0..1. .0..1..0..1..1. .0..0..0..0..0. .0..1..0..1..1
%e ..1..1..1..0..1. .1..0..1..0..1. .1..0..1..1..0. .1..0..1..0..1
%e ..0..0..1..1..0. .1..0..1..0..1. .1..1..0..0..0. .0..0..1..1..0
%Y Cf. A302965.
%K nonn
%O 1,1
%A _R. H. Hardin_, Apr 16 2018