Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084565
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084565 Number of connected switching classes of signed graphs with n nodes. +0
2
1, 1, 3, 12, 79, 1123, 42065, 4880753, 1674021742, 1612191702946, 4291399235883144, 31570649902282023158, 644451747846907273827686, 36675914469877423648734408329, 5846124500387959287169919356171145 (list; graph; listen)
OFFSET

1,3

COMMENT

Also, number of unlabeled connected strength 2 Eulerian graphs with n nodes. - Vladeta Jovovic (vladeta(AT)eunet.yu), Mar 14 2009

REFERENCES

Bussemaker, F. C.; Cameron, P. J.; Seidel, J. J.; and Tsaranov, S. V., Tables of signed graphs, Report-WSK 91-01, Eindhoven University of Technology, Department of Mathematics and Computing Science, Eindhoven, 1991, 105 pp. MR: 92g:05001.

CROSSREFS

Cf. A007127, A053465.

Sequence in context: A058561 A058107 A023879 this_sequence A023881 A067111 A051549

Adjacent sequences: A084562 A084563 A084564 this_sequence A084566 A084567 A084568

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com) Apr 05 2009 at the suggestion of Vladeta Jovovic

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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research