Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #3 Oct 15 2015 06:46:22
%S 1,1,1,3,6,3,9,38,38,9,23,226,1013,226,23,51,1620,11447,11447,1620,51,
%T 133,12653,232939,614393,232939,12653,133,399,100234,5387677,38059944,
%U 38059944,5387677,100234,399,1321,805414,123078860
%N T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with each row and column divisible by 11, read as a base-3 number with top and left being the most significant digits.
%C Table starts
%C ...1......1.......3........9.......23......51.......133....399.1321
%C ...1......6......38......226.....1620...12653....100234.805414
%C ...3.....38....1013....11447...232939.5387677.123078860
%C ...9....226...11447...614393.38059944
%C ..23...1620..232939.38059944
%C ..51..12653.5387677
%C .133.100234
%C .399
%F Empirical for column k:
%F k=1: [linear recurrence of order 26]
%e Some solutions for n=3 k=4
%e ..0..0..0..1..0..2....0..2..2..2..2..2....2..0..1..1..2..0....2..1..1..2..1..1
%e ..0..0..0..1..0..2....0..2..0..1..1..2....0..0..1..1..2..2....2..1..1..1..0..2
%e ..0..2..2..1..2..0....0..0..1..1..2..2....1..0..1..1..2..1....0..2..1..1..0..0
%e ..0..1..1..1..1..1....0..1..1..0..0..2....1..0..1..1..2..1....1..2..1..0..2..2
%e ..0..1..1..1..1..1....0..1..2..0..2..2....2..0..1..1..2..0....1..0..1..0..1..2
%K nonn,tabl
%O 1,4
%A _R. H. Hardin_, Oct 15 2015