Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085618
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A085618 Number of self-complementary 2-graphs with n nodes. +0
2
1, 1, 4, 0, 19, 10 (list; graph; listen)
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.

CROSSREFS

Cf. A006627, A002854.

Sequence in context: A137279 A167350 A156457 this_sequence A076021 A078630 A057402

Adjacent sequences: A085615 A085616 A085617 this_sequence A085619 A085620 A085621

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jul 11 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research