login

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”).

Number of (n+3)X(3+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 #4 Oct 13 2015 18:17:10

%S 228,1504,8818,45174,231794,1175574,5973996,30040618,152059128,

%T 756272532,3780011054,18903094466,94583752654,472578275050,

%U 2362223640926,11809789092100,59059704911636,295279046414212,1476177725665244

%N Number of (n+3)X(3+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 3 of A263303.

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

%e Some solutions for n=4

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

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

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

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

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

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

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

%Y Cf. A263303.

%K nonn

%O 1,1

%A _R. H. Hardin_, Oct 13 2015