%I A058872
%S A058872 0,2,12,80,720,9152,165312,4244480,154732800,8005686272,587435092992,
%T A058872 61116916981760,9011561121239040,1882834327457349632,557257804202631217152,
%U A058872 233610656002563147038720,138681207656726645785559040,116575238610106596799428165632
%N A058872 Number of 2-colored labeled graphs with n nodes.
%D A058872 F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY,
1973, p. 18, Table 1.5.1.
%D A058872 A. Mukhopadhyay, Lupanov decoding networks, in A. Mukhopadhyay, ed.,
Recent Developments in Switching Theory, Ac. Press, 1971, Chap. 3,
see esp. p. 82 (number of shell functions).
%p A058872 A058872 := n->add(binomial(n,k)*2^(n-k)*2^(k*(n-k)),k=0..n-1);
%Y A058872 A diagonal of A058843.
%Y A058872 Sequence in context: A069723 A063481 A052822 this_sequence A055548 A092850
A052864
%Y A058872 Adjacent sequences: A058869 A058870 A058871 this_sequence A058873 A058874
A058875
%K A058872 nonn
%O A058872 1,2
%A A058872 N. J. A. Sloane (njas(AT)research.att.com), Jan 07 2001
|