Search: id:A122086
Results 1-1 of 1 results found.

%I A122086
%S A122086 2,1,2,3,6,10,22,42,94,203,470,1082,2602,6270,15482,38525,97258,247448,
%T A122086 635910,1645411,4289010,11245670,29656148,78595028,209273780,559574414,
%U A122086 1502130920,4046853091,10939133170,29661655793
%N A122086 Number of unlabeled free bicolored trees with n nodes (the colors are 
               not interchangeable).
%C A122086 Row sums of A122085.
%D A122086 R. W. Robinson, Numerical implementation of graph counting algorithms, 
               AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1978.
%F A122086 For n even, a(n) = 2*A000055(n) - A000081(n/2), for n odd, a(n) = 2*A000055(n).
%Y A122086 Cf. A122085. Same as A125702 except for n = 1.
%Y A122086 Sequence in context: A056493 A001371 A001037 this_sequence A082594 A051850 
               A077013
%Y A122086 Adjacent sequences: A122083 A122084 A122085 this_sequence A122087 A122088 
               A122089
%K A122086 nonn
%O A122086 1,1
%A A122086 N. J. A. Sloane (njas(AT)research.att.com), Oct 19 2006
%E A122086 Edited by Christian Bower (bowerc(AT)usa.net) and Franklin T. Adams-Watters 
               (FrankTAW(AT)Netscape.net), Jan 05 2007

Search completed in 0.001 seconds