Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006545
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006545 Number of stable unicyclic graphs with n nodes.
(Formerly M0885)
+0
1
1, 2, 3, 8, 22, 62 (list; graph; listen)
OFFSET

3,2

REFERENCES

K. L. McAvaney, Counting stable trees, pp. 79-85 of Combinatorial Mathematics (Proceedings 2nd Australian Conf.), Lect. Notes Math. 403, 1974.

K. L. McAvaney, personal communication.

CROSSREFS

Adjacent sequences: A006542 A006543 A006544 this_sequence A006546 A006547 A006548

Sequence in context: A004790 A098119 A049959 this_sequence A121050 A089402 A127940

KEYWORD

nonn

AUTHOR

njas

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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research