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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126133 Number of edge-rooted unlabeled graphs with n edges. 2
1, 2, 7, 21, 66, 210, 699, 2387, 8492, 31329, 120034, 477028, 1965016, 8377888, 36923184, 167972182, 787688821, 3802526173, 18873118341, 96195592212, 502953711022, 2694740822749, 14781176429303, 82931707378322 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973.

LINKS

Max Alekseyev, Table of n, a(n) for n = 1..40

EXAMPLE

a(3)=7: the triangular graph with one edge rooted. The disconnected graph of the connected linear graph with 3 nodes aside the connected graph with 2 nodes, 2 choices for the root. The three disconnected graphs with 3 graphs on 2 nodes, one of the three with the root. The connected star graph with one edge rooted. The connected linear graph with four nodes, 2 choices for the root. - R. J. Mathar, May 03 2018

CROSSREFS

Cf. A000664, A126122, A303832 (connected).

Sequence in context: A037520 A218836 A052911 * A186240 A274203 A220726

Adjacent sequences:  A126130 A126131 A126132 * A126134 A126135 A126136

KEYWORD

nonn

AUTHOR

Vladeta Jovovic, Mar 07 2007

EXTENSIONS

Terms a(10) onward from Max Alekseyev, May 03 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 October 20 02:51 EDT 2019. Contains 328244 sequences. (Running on oeis4.)