The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #4 Oct 13 2015 18:18:50
%S 0,42,228,3516,51978,760086,10182786,142451394,2024998492,28003513524,
%T 390054673950,5448913266138,76316796020802,1067811636132864,
%U 14945387348188038,209239063221488316,2929450625517309300
%N Number of (1+3)X(n+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 Row 1 of A263303.
%H R. H. Hardin, <a href="/A263304/b263304.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=4
%e ..0..0..1..1..0..1..0....1..1..1..0..1..0..1....1..1..0..1..0..0..0
%e ..0..1..1..0..1..0..0....0..0..0..1..1..0..1....0..1..1..0..1..0..0
%e ..1..1..1..0..1..0..1....1..0..0..1..1..1..0....1..0..0..1..1..1..0
%e ..1..0..0..0..0..0..1....1..0..0..1..1..1..0....1..0..1..1..0..1..1
%Y Cf. A263303.
%K nonn
%O 1,2
%A _R. H. Hardin_, Oct 13 2015