Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003660
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003660 Number of nontrivial disconnected complements of Steinhaus graphs on n nodes.
(Formerly M0606)
+0
2
1, 2, 3, 5, 5, 5, 7, 5, 6, 8, 8, 9, 11, 11, 12, 15, 14, 14, 15, 14, 14, 15, 15, 14, 16 (list; graph; listen)
OFFSET

7,2

REFERENCES

W. M. Dymacek, Complements of Steinhaus graphs, Discrete Math., 37 (1981), 167-180.

CROSSREFS

Adjacent sequences: A003657 A003658 A003659 this_sequence A003661 A003662 A003663

Sequence in context: A131295 A102642 A133304 this_sequence A111164 A029910 A063677

KEYWORD

nonn

AUTHOR

njas, Mira Bernstein

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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research