login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006544 Number of stable forests with n nodes.
(Formerly M0702)
3
1, 1, 2, 3, 5, 8, 15, 27, 54, 110, 238, 526, 1211, 2839, 6825, 16655, 41315, 103663, 263086, 673604, 1739155, 4521632, 11831735, 31134338, 82352098, 218837877, 584018065, 1564679863, 4207224730, 11350583175, 30718054693, 83373960954, 226907180850, 619118327796 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
K. L. McAvaney, Counting stable trees, pp. 79-85 of Combinatorial Mathematics (Proceedings 2nd Australian Conf.), Lect. Notes Math. 403, 1974.
FORMULA
G.f.: Sum_{n>=1} Z(S_n,s(x)) where s(x) is the g.f. for A003426 and Z(S_n) is the cycle index of the symmetric group on n elements. - Sean A. Irvine, Feb 13 2016
CROSSREFS
Sequence in context: A101172 A192677 A307909 * A110536 A049861 A130476
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms from Sean A. Irvine, Feb 13 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)