Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126133
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A126133 Number of edge-rooted unlabeled graphs with n edges. +0
1
1, 2, 7, 21, 66, 210, 699, 2387, 8492 (list; graph; listen)
OFFSET

1,2

REFERENCES

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

CROSSREFS

Cf. A000664.

Sequence in context: A027990 A037520 A052911 this_sequence A127540 A060900 A151289

Adjacent sequences: A126130 A126131 A126132 this_sequence A126134 A126135 A126136

KEYWORD

more,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 07 2007

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 December 6 19:58 EST 2009. Contains 170429 sequences.


AT&T Labs Research