|
%I #4 Sep 06 2015 07:55:18
%S 0,0,0,10,2,0,0,61,5,0,46,147,218,12,0,0,1215,746,1878,31,0,202,5826,
%T 10906,7943,9350,57,0,415,28021,72186,351513,50994,57243,112,0,852,
%U 110420,588090,3016874,5488030,367390,352480,296,0,1739,527295,3656900
%N T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each row nonprime and column prime, read as a binary number with top and left being the most significant bits.
%C Table starts
%C .0....0.......10........0.........46..........0........202.........415
%C .0....2.......61......147.......1215.......5826......28021......110420
%C .0....5......218......746......10906......72186.....588090.....3656900
%C .0...12.....1878.....7943.....351513....3016874...64650845...773758878
%C .0...31.....9350....50994....5488030...52973290.2828445617.58321826870
%C .0...57....57243...367390..115507073.1247810761
%C .0..112...352480..2840132.2499416567
%C .0..296..2438528.26703908
%C .0..833.15405064
%C .0.1889
%H R. H. Hardin, <a href="/A261942/b261942.txt">Table of n, a(n) for n = 1..71</a>
%e Some solutions for n=4 k=4
%e ..0..1..0..0..0....0..1..0..0..0....0..0..0..0..1....0..0..0..0..1
%e ..1..0..1..1..0....0..0..0..0..0....0..1..0..0..1....0..1..0..0..1
%e ..0..0..1..0..0....1..1..0..1..1....0..0..0..0..1....0..1..1..1..1
%e ..1..1..0..1..1....0..1..1..1..0....1..1..1..1..0....1..0..0..1..0
%e ..1..1..1..1..0....1..1..0..1..1....1..1..0..0..1....0..1..1..1..1
%K nonn,tabl
%O 1,4
%A _R. H. Hardin_, Sep 06 2015
|
