login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085618 Number of self-complementary 2-graphs with n nodes. 1
1, 1, 4, 0, 19, 10 (list; graph; refs; listen; history; text; internal format)
OFFSET

4,3

REFERENCES

F. C. Bussemaker, R. A. Mathon and J. J. Seidel, Tables of two-graphs, T.H.-Report 79-WSK-05, Technological University Eindhoven, Dept. Mathematics, 1979; also pp. 71-112 of "Combinatorics and Graph Theory (Calcutta, 1980)", Lect. Notes Math. 885, 1981.

T. Sozanski, Enumeration of weak isomorphism classes of signed graphs, J. Graph Theory 4 (1980), no. 2, 127-144.

LINKS

Table of n, a(n) for n=4..9.

CROSSREFS

Cf. A006627, A002854.

Sequence in context: A156457 A058348 A184946 * A263626 A076021 A282579

Adjacent sequences:  A085615 A085616 A085617 * A085619 A085620 A085621

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jul 11 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 25 10:37 EDT 2020. Contains 334592 sequences. (Running on oeis4.)