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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006545 Number of stable unicyclic graphs with n nodes.
(Formerly M0885)
1
1, 2, 3, 8, 22, 62 (list; graph; refs; listen; history; text; internal format)
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.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=3..8.

K. L. McAvaney, Letter to N. J. A. Sloane, May 1975

CROSSREFS

Cf. A006544, A003426-A003429.

Sequence in context: A272333 A098119 A049959 * A089402 A127940 A006796

Adjacent sequences:  A006542 A006543 A006544 * A006546 A006547 A006548

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane.

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 July 22 14:33 EDT 2019. Contains 325222 sequences. (Running on oeis4.)