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 12 2015 10:54:05
%S 22874,362522,362522,5416302,12507525,5416302,78580226,395174691,
%T 395174691,78580226,1104667450,11968129797,25864201119,11968129797,
%U 1104667450,15573947878,347731730746,1606472091969,1606472091969
%N T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row and column not divisible by 15, read as a binary number with top and left being the most significant bits.
%C Table starts
%C ......22874.......362522........5416302..........78580226..........1104667450
%C .....362522.....12507525......395174691.......11968129797........347731730746
%C ....5416302....395174691....25864201119.....1606472091969......94851590043422
%C ...78580226..11968129797..1606472091969...202905795763881...24147513560607154
%C .1104667450.347731730746.94851590043422.24147513560607154.5746693771013401690
%H R. H. Hardin, <a href="/A263215/b263215.txt">Table of n, a(n) for n = 1..48</a>
%e Some solutions for n=1 k=4
%e ..0..0..1..1..0..0..0....0..0..0..1..0..1..1....0..0..1..0..0..1..1
%e ..0..0..0..1..0..0..1....0..0..1..0..0..1..1....0..0..1..0..0..0..0
%e ..0..0..0..1..0..1..0....0..1..0..1..0..0..1....0..1..0..1..0..0..1
%e ..1..1..1..0..1..1..1....1..0..1..0..1..0..0....1..1..0..1..1..1..1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Oct 12 2015