%I #5 Sep 18 2015 07:31:22
%S 2,5,90,2399,570922,394241389,1456404454010,19392931688071671,
%T 1134083007177482717802,256890679674803015904974405,
%U 239672757231397671662393429466490
%N Number of (n+1)X(n+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits.
%C Diagonal of A262332.
%H R. H. Hardin, <a href="/A262325/b262325.txt">Table of n, a(n) for n = 1..12</a>
%e Some solutions for n=4
%e ..1..1..0..1..1....0..0..0..0..0....0..0..1..1..0....1..0..0..1..0
%e ..0..1..0..0..1....1..0..0..1..0....0..1..1..1..1....0..1..1..1..1
%e ..1..0..0..1..0....1..0..0..1..0....0..0..0..1..1....0..0..0..0..0
%e ..0..0..0..0..0....0..0..0..0..0....0..0..1..1..0....1..0..0..1..0
%e ..1..0..0..1..0....0..0..0..0..0....0..1..1..0..0....0..1..1..1..1
%Y Cf. A262332.
%K nonn
%O 1,1
%A _R. H. Hardin_, Sep 18 2015
