login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006289 Number of series-reduced 2-connected graphs with n nodes.
(Formerly M3058)
2
1, 3, 19, 149, 2581, 84151, 5201856, 577050233, 113372069299, 39618015318982, 24916462761069296, 28563626972509456884, 60366734349116636660402, 237406975840304068884168139, 1750330441810569047176394509086 (list; graph; refs; listen; history; internal format)
OFFSET

4,2

REFERENCES

R. W. Robinson and T. R. S. Walsh, Inversion of cycle index sum relations for 2- and 3-connected graphs. J. Combin. Theory Ser. B 57 (1993), no. 2, 289-308.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Walsh, T. R. S.; Counting unlabeled three-connected and homeomorphically irreducible two-connected graphs. J. Combin. Theory Ser. B 32 (1982), no. 1, 12-32.

LINKS

R. W. Robinson, Tables

R. W. Robinson and T. R. S. Walsh, Inversion of cycle index sum relations for 2- and 3-connected graphs, J. Combin. Theory Ser. B. 57 (1993), 289-308.

CROSSREFS

Cf. A006290.

Sequence in context: A131551 A074546 A054316 * A120590 A007112 A007111

Adjacent sequences:  A006286 A006287 A006288 * A006290 A006291 A006292

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Robinson and Walsh list first 25 terms.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:47 EST 2012. Contains 205978 sequences.