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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007812 Number of n-node Steinhaus graphs whose complements have at least one cut-vertex. 0
0, 1, 3, 2, 6, 17, 33, 56, 72, 88, 114, 140, 160, 190, 211, 250, 290, 322, 356, 404, 438, 474, 530, 580, 626, 682, 728 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

REFERENCES

W. M. Dymacek, M. Koerlin, T. Whaley, A survey of Steinhaus graphs, Proc. 8th Quadrennial International Conf. on Graph Theory, Combinatorics, Algorithms and Application, Kalamazoo, Mich. 1996, pages 313-323, Vol. I.

LINKS

Table of n, a(n) for n=1..27.

W. Dymacek, T. Whaley, Generating strings for bipartite Steinhaus graphs, Discrete Math. 141 (1995), pages 97-107.

CROSSREFS

Sequence in context: A289069 A074718 A285457 * A276225 A082561 A268642

Adjacent sequences:  A007809 A007810 A007811 * A007813 A007814 A007815

KEYWORD

nonn,more

AUTHOR

Wayne M. Dymacek (dymacek(AT)fs.sciences.wlu.edu)

EXTENSIONS

a(23)-a(27) from Sean A. Irvine, Feb 04 2018

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 November 30 15:45 EST 2020. Contains 338807 sequences. (Running on oeis4.)