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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126122 Number of edge-rooted unlabeled graphs on n nodes. 2
0, 1, 3, 14, 74, 572, 6564, 125120, 4147832, 247183688, 26814414976, 5327509126272, 1946813194004224, 1313879013920844480, 1644521424392726492800, 3833402238753872010743808, 16708198671847617602943683072, 136682601082422255664288717142080 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

In other words, number of unlabeled graphs on n nodes with a marked edge.

REFERENCES

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

LINKS

Vladeta Jovovic, Table of n, a(n) for n = 1..40

CROSSREFS

Cf. A000088, A000666.

Sequence in context: A210346 A074549 A245246 * A026004 A200718 A063016

Adjacent sequences:  A126119 A126120 A126121 * A126123 A126124 A126125

KEYWORD

nonn

AUTHOR

Vladeta Jovovic, Mar 07 2007

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 9 16:26 EST 2016. Contains 278985 sequences.