Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001072
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001072 Number of minimally 2-edge-connected graphs with n nodes. +0
4
1, 1, 3, 4, 11, 23, 63, 159 (list; graph; listen)
OFFSET

3,3
REFERENCES

Calculated by Sridar K. Pootheri

CROSSREFS

Sequence in context: A001643 A005218 A131481 this_sequence A077900 A041231 A042129

Adjacent sequences: A001069 A001070 A001071 this_sequence A001073 A001074 A001075

KEYWORD

nonn,hard

AUTHOR

R. W. Robinson, rwr(AT)pollux.cs.uga.edu

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

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.