|
%I #7 May 25 2017 14:46:33
%S 1,1,0,1,0,5,1,0,19,1,0,205,65,1,0,1795,211,1,0,36317,14221,665,1,0,
%T 636331,106819,2059,1,0,23679901,10365005,778765,6305,1,0,805351531,
%U 162470155,5581315,19171,1,0,56294206205,26175881341,2495037197
%N Triangle read by rows: T(n,k) = number of specially labeled bicolored connected 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 = floor((n+1)/2), ..., n).
%D R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1977.
%H R. W. Robinson, <a href="/A123260/b123260.txt">Rows 1 through 30, flattened</a>
%e The first few entries are:
%e T( 1, 0) = 1
%e T( 1, 1) = 1
%e T( 2, 0) = 0
%e T( 2, 1) = 1
%e T( 3, 0) = 0
%e T( 2, 2) = 5
%e T( 3, 1) = 1
%e T( 4, 0) = 0
%e T( 3, 2) = 19
%e T( 4, 1) = 1
%e T( 5, 0) = 0
%e T( 3, 3) = 205
%e T( 4, 2) = 65
%e T( 5, 1) = 1
%e T( 6, 0) = 0
%e 1, 1;
%e 0, 1, 5 ;
%e 0, 1, 19, 205;
%e 0, 1, 65, 1795, 36317;
%e 0, 1, 211, 14221, ,...
%e 0, 1, ....
%e 0,
%Y Leading diagonal gives A123281. Cf. A262307.
%K nonn,tabf
%O 1,6
%A _N. J. A. Sloane_, Nov 12 2006
|
