%I
%S 10,12,270,1260,15310,124572,1299070,12380940,124921710,1235566332,
%T 12379963870,123483616620,1235387708110,12346379507292,
%U 123476688644670,1234585890852300,12346166930494510,123457247499499452
%N Number of (3+1)X(n+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits.
%C Row 3 of A262420.
%H R. H. Hardin, <a href="/A262422/b262422.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 10*a(n1) +46*a(n2) 460*a(n3) 609*a(n4) +6090*a(n5) +2164*a(n6) 21640*a(n7) 1600*a(n8) +16000*a(n9)
%e Some solutions for n=4
%e ..1..1..0..1..1....0..1..1..1..1....0..0..0..1..1....0..0..1..1..0
%e ..0..0..1..1..0....1..1..1..1..0....1..1..0..1..1....0..1..0..0..1
%e ..0..1..1..1..1....1..1..0..1..1....1..0..0..1..0....1..0..1..0..1
%e ..0..1..1..0..0....1..0..1..0..1....1..0..1..0..1....0..1..0..0..1
%Y Cf. A262420.
%K nonn
%O 1,1
%A _R. H. Hardin_, Sep 22 2015
