%I #4 Oct 16 2015 08:10:46
%S 4,38,496,6731,93378,1302087,18221996,255080336,3571083234,
%T 49994778319,699925682414,9798949321655,137185276830144,
%U 1920593788732430,26888312935819112,376436379758582067,5270109313747856290
%N Number of (n+1)X(2+1) 0..4 arrays with each row and column divisible by 9, read as a base-5 number with top and left being the most significant digits.
%C Column 2 of A263382.
%H R. H. Hardin, <a href="/A263376/b263376.txt">Table of n, a(n) for n = 1..210</a>
%H R. H. Hardin, <a href="/A263376/a263376.txt">Empirical recurrence of order 51</a>
%F Empirical recurrence of order 51 (see link above)
%e Some solutions for n=4
%e ..2..2..3....0..0..0....2..2..3....2..2..3....0..1..4....4..3..2....2..4..2
%e ..1..4..0....3..1..1....0..3..3....3..4..4....2..4..2....3..4..4....3..4..4
%e ..3..1..1....3..1..1....2..4..2....1..4..0....0..3..3....4..3..2....3..3..0
%e ..3..1..1....0..0..0....1..4..0....1..4..0....4..1..3....0..3..3....3..4..4
%e ..2..2..3....0..3..3....0..1..4....1..2..1....0..1..4....4..1..3....4..1..3
%Y Cf. A263382.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 16 2015