%I A123301
%S A123301 1,0,0,0,1,0,0,1,1,0,0,1,34,1,0,0,1,199,199,1,0,0,1,916,7037,916,1,
%T A123301 0,0,1,3889,117071,117071,3889,1,0,0,1,15982,1535601,6317926,
%U A123301 1535601,15982,1,0,0,1,64747,18271947,228842801,228842801,18271947
%N A123301 Triangle read by rows: T(n,k) = number of specially labeled bicolored 
               nonseparable graphs with k points in one color class and n-k points 
               in the other class . "Special" means there are separate labels 1,
               2, ...,k and 1,2, ...,n-k for the two color classes (n >= 1, k = 
               1, ..., n-1).
%D A123301 R. W. Robinson, Numerical implementation of graph counting algorithms, 
               AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1977.
%H A123301 R. W. Robinson, <a href="b123301.txt">Rows 1 through 25, flattened</a>
%e A123301 Triangle begins:
%e A123301 T( 1, 1) = 1
%e A123301 T( 1, 2) = 0
%e A123301 T( 2, 1) = 0
%e A123301 T( 1, 3) = 0
%e A123301 T( 2, 2) = 1
%e A123301 T( 3, 1) = 0
%e A123301 T( 1, 4) = 0
%e A123301 T( 2, 3) = 1
%e A123301 T( 3, 2) = 1
%e A123301 T( 4, 1) = 0
%e A123301 T( 1, 5) = 0
%e A123301 T( 2, 4) = 1
%e A123301 T( 3, 3) = 34
%e A123301 T( 4, 2) = 1
%e A123301 T( 5, 1) = 0
%e A123301 T( 1, 6) = 0
%e A123301 T( 2, 5) = 1
%e A123301 T( 3, 4) = 199
%e A123301 T( 4, 3) = 199
%e A123301 T( 5, 2) = 1
%e A123301 T( 6, 1) = 0
%Y A123301 Sequence in context: A060767 A023928 A022070 this_sequence A037933 A098765 
               A071788
%Y A123301 Adjacent sequences: A123298 A123299 A123300 this_sequence A123302 A123303 
               A123304
%K A123301 nonn,tabl
%O A123301 1,13
%A A123301 N. J. A. Sloane (njas(AT)research.att.com), Nov 12 2006