|
%I #4 Sep 24 2015 07:51:28
%S 2,3,3,5,5,5,10,9,9,10,20,23,17,23,20,40,63,61,61,63,40,79,171,245,
%T 389,245,171,79,158,449,877,2699,2699,877,449,158,316,1251,3025,16108,
%U 33742,16108,3025,1251,316,631,3753,11357,93941,364259,364259,93941,11357,3753
%N T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row and column divisible by 13, read as a binary number with top and left being the most significant bits.
%C Table starts
%C ...2.....3......5......10.......20........40........79......158.....316
%C ...3.....5......9......23.......63.......171.......449.....1251....3753
%C ...5.....9.....17......61......245.......877......3025....11357...56785
%C ..10....23.....61.....389.....2699.....16108.....93941...601676.4905724
%C ..20....63....245....2699....33742....364259...3810228.45013100
%C ..40...171....877...16108...364259...6945738.128397052
%C ..79...449...3025...93941..3810228.128397052
%C .158..1251..11357..601676.45013100
%C .316..3753..56785.4905724
%C .631.10361.172369
%H R. H. Hardin, <a href="/A262488/b262488.txt">Table of n, a(n) for n = 1..82</a>
%F Empirical for column k:
%F k=1: a(n) = 3*a(n-1) -2*a(n-2) -a(n-6) +3*a(n-7) -2*a(n-8)
%F k=2: [order 47]
%e Some solutions for n=4 k=4
%e ..1..0..0..0..0..0..1....1..1..1..0..1..0..1....1..1..1..0..1..0..1
%e ..0..0..1..1..0..1..0....1..0..0..0..0..0..1....1..0..0..0..0..0..1
%e ..0..0..1..1..0..1..0....1..0..0..0..0..0..1....0..0..0..0..0..0..0
%e ..1..0..0..0..0..0..1....0..1..1..0..1..0..0....1..0..0..0..0..0..1
%e ..1..0..1..1..0..1..1....1..1..1..0..1..0..1....0..0..0..0..0..0..0
%e ..1..0..0..0..0..0..1....0..1..1..0..1..0..0....0..0..0..0..0..0..0
%e ..0..0..0..0..0..0..0....1..0..0..0..0..0..1....0..1..1..0..1..0..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Sep 24 2015
| 