|
%I #4 Oct 19 2015 09:46:05
%S 2,3,3,8,17,8,23,173,173,23,67,2067,8099,2067,67,200,24687,457757,
%T 457757,24687,200,597,296225,25806394,130504565,25806394,296225,597,
%U 1790,3553436,1469325216,36671816671,36671816671,1469325216,3553436,1790,5369
%N T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with each row and column divisible by 11, read as a base-5 number with top and left being the most significant digits.
%C Table starts
%C ...2.......3...........8...............23................67...............200
%C ...3......17.........173.............2067.............24687............296225
%C ...8.....173........8099...........457757..........25806394........1469325216
%C ..23....2067......457757........130504565.......36671816671....10436759312923
%C ..67...24687....25806394......36671816671....51240208193188.72687824624930136
%C .200..296225..1469325216...10436759312923.72687824624930136
%C .597.3553436.83724117885.2973220065573027
%H R. H. Hardin, <a href="/A263464/b263464.txt">Table of n, a(n) for n = 1..60</a>
%F Empirical for column k:
%F k=1: a(n) = 3*a(n-1) +a(n-5) -3*a(n-6)
%e Some solutions for n=3 k=4
%e ..0..0..4..4..1....1..0..3..0..4....1..4..4..1..2....0..4..0..3..2
%e ..0..3..2..3..0....0..1..2..0..1....0..4..2..0..0....0..1..3..1..4
%e ..4..0..4..3..3....1..1..3..4..2....3..3..0..1..0....4..2..2..1..0
%e ..2..2..2..4..3....2..3..0..2..4....3..1..0..2..3....2..4..3..2..2
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Oct 19 2015
| 