Search: id:A000171
Results 1-1 of 1 results found.
%I A000171 M0014 N0780
%S A000171 1,0,0,1,2,0,0,10,36,0,0,720,5600,0,0,703760,11220000,0,0,9168331776,
%T A000171 293293716992,0,0,1601371799340544,102484848265030656,0,0,
%U A000171 3837878966366932639744,491247277315343649710080,0,0
%N A000171 Number of self-complementary graphs with n nodes.
%C A000171 a(n)=A007869(n)-A054960(n), where A007869(n) is number of unlabeled graphs
with n nodes and an even number of edges and A054960(n) is number
of unlabeled graphs with n nodes and an odd nu mber of edges.
%D A000171 F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY,
1973, p. 139, Table 6.1.1.
%D A000171 R. C. Read, On the number of self-complementary graphs and digraphs,
J. London Math. Soc., 38 (1963), 99-104.
%D A000171 R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
%D A000171 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973
(includes this sequence).
%D A000171 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences,
Academic Press, 1995 (includes this sequence).
%D A000171 D. Wille, Enumeration of self-complementary structures, J. Comb. Theory
B 25 (1978) 143-150.
%H A000171 H. Fripertinger, Self-complementary graphs
%H A000171 Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
a>
%Y A000171 A000171(4*n)=A003086(2*n). Cf. A047660, A051251, A047832.
%Y A000171 Sequence in context: A113036 A000425 A010893 this_sequence A054922 A061848
A120556
%Y A000171 Adjacent sequences: A000168 A000169 A000170 this_sequence A000172 A000173
A000174
%K A000171 nonn,nice,easy
%O A000171 1,5
%A A000171 N. J. A. Sloane (njas(AT)research.att.com).
%E A000171 More terms from R. C. Read (rcread(AT)math.uwaterloo.ca) and Vladeta
Jovovic (vladeta(AT)eunet.rs).
Search completed in 0.001 seconds