|
%I #4 Oct 12 2015 11:50:08
%S 1,2,2,4,14,4,7,72,72,7,13,343,1009,343,13,26,1920,12601,12601,1920,
%T 26,52,11444,198892,475539,198892,11444,52,103,68112,3345984,22342751,
%U 22342751,3345984,68112,103,205,405019,56362801,1094138875,3126162435
%N T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with each row and column divisible by 5, read as a base-3 number with top and left being the most significant digits.
%C Table starts
%C ...1......2.........4.............7...............13...................26
%C ...2.....14........72...........343.............1920................11444
%C ...4.....72......1009.........12601...........198892..............3345984
%C ...7....343.....12601........475539.........22342751...........1094138875
%C ..13...1920....198892......22342751.......3126162435.........456363243352
%C ..26..11444...3345984....1094138875.....456363243352......199878687706434
%C ..52..68112..56362801...53375395657...66317081173996....87072717791078712
%C .103.405019.951167305.2607171566653.9651690803653879.37998530090131229539
%H R. H. Hardin, <a href="/A263224/b263224.txt">Table of n, a(n) for n = 1..144</a>
%F Empirical for column k:
%F k=1: a(n) = 3*a(n-1) -3*a(n-2) +3*a(n-3) -2*a(n-4)
%F k=2: [order 16]
%F k=3: [order 26]
%F k=4: [order 89]
%e Some solutions for n=3 k=4
%e ..0..0..2..0..2....0..2..1..0..2....2..2..2..0..1....2..2..2..0..1
%e ..1..1..1..2..2....1..0..2..0..1....0..0..0..0..0....0..1..0..2..2
%e ..0..0..2..2..1....2..2..1..0..0....0..0..2..0..2....2..0..2..0..0
%e ..1..1..1..1..0....0..0..2..0..2....1..1..0..0..2....0..2..0..2..0
%Y Column 1 is A262267(n-1).
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_, Oct 12 2015
| 