login
Number of (n+3)X(2+3) 0..1 arrays with each row divisible by 13 and column not divisible by 13, read as a binary number with top and left being the most significant bits.
1

%I #5 Oct 13 2015 18:16:25

%S 42,156,522,1604,4866,14776,45046,136248,408744,1235360,3719846,

%T 11182556,33561550,100772348,302469454,907514652,2722696390,

%U 8168583528,24507705554,73526125728,220578377184,661760369600,1985318969554

%N Number of (n+3)X(2+3) 0..1 arrays with each row divisible by 13 and column not divisible by 13, read as a binary number with top and left being the most significant bits.

%C Column 2 of A263303.

%H R. H. Hardin, <a href="/A263300/b263300.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 3*a(n-1) -a(n-2) +3*a(n-3) -a(n-4) +3*a(n-5) -a(n-6) +3*a(n-7) -a(n-8) +3*a(n-9) -a(n-10) +3*a(n-11) +2811*a(n-12) -8433*a(n-13) +2811*a(n-14) -8433*a(n-15) +2811*a(n-16) -8433*a(n-17) +2811*a(n-18) -8433*a(n-19) +2811*a(n-20) -8433*a(n-21) +2811*a(n-22) -8433*a(n-23) -219911*a(n-24) +659733*a(n-25) -219911*a(n-26) +659733*a(n-27) -219911*a(n-28) +659733*a(n-29) -219911*a(n-30) +659733*a(n-31) -219911*a(n-32) +659733*a(n-33) -219911*a(n-34) +659733*a(n-35) +3908061*a(n-36) -11724183*a(n-37) +3908061*a(n-38) -11724183*a(n-39) +3908061*a(n-40) -11724183*a(n-41) +3908061*a(n-42) -11724183*a(n-43) +3908061*a(n-44) -11724183*a(n-45) +3908061*a(n-46) -11724183*a(n-47)

%e Some solutions for n=4

%e ..0..0..0..0..0....1..1..0..1..0....1..1..0..1..0....0..0..0..0..0

%e ..1..1..0..1..0....1..1..0..1..0....0..0..0..0..0....1..1..0..1..0

%e ..0..0..0..0..0....1..1..0..1..0....1..1..0..1..0....1..1..0..1..0

%e ..1..1..0..1..0....1..1..0..1..0....0..0..0..0..0....0..0..0..0..0

%e ..0..1..1..0..1....1..1..0..1..0....0..0..0..0..0....0..0..0..0..0

%e ..1..1..0..1..0....0..1..1..0..1....0..0..0..0..0....1..1..0..1..0

%e ..1..1..0..1..0....0..0..0..0..0....0..1..1..0..1....0..1..1..0..1

%Y Cf. A263303.

%K nonn

%O 1,1

%A _R. H. Hardin_, Oct 13 2015