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

%I A122082
%S A122082 1,2,5,16,67,404,3904,64840,1930842,104698904,10401039400,1900637187280,
%T A122082 641429385018832,401454435464761376,467919402404052870944,
%U A122082 1019758699013228238271040,4171161230867751509749228304
%N A122082 Number of unlabeled bicolored graphs on 2n nodes which are invariant 
               when the two color classes are interchanged.
%D A122082 R. W. Robinson, Numerical implementation of graph counting algorithms, 
               AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.
%F A122082 a(n) = 2*A007139(n)-A002724(n). - Vladeta Jovovic (vladeta(AT)eunet.rs), 
               Feb 27 2007
%Y A122082 Sequence in context: A019504 A005163 A006116 this_sequence A002631 A107948 
               A058673
%Y A122082 Adjacent sequences: A122079 A122080 A122081 this_sequence A122083 A122084 
               A122085
%K A122082 nonn
%O A122082 0,2
%A A122082 N. J. A. Sloane (njas(AT)research.att.com), Oct 18 2006
%E A122082 More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 27 2007

Search completed in 0.001 seconds