Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006544
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006544 Number of stable forests with n nodes.
(Formerly M0702)
+0
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 (list; graph; listen)
OFFSET

1,2

REFERENCES

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

CROSSREFS

Sequence in context: A026702 A000047 A101172 this_sequence A110536 A049861 A130476

Adjacent sequences: A006541 A006542 A006543 this_sequence A006545 A006546 A006547

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research