login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A058866
Number of 2-trees rooted at an edge.
9
1, 2, 6, 21, 83, 356, 1599, 7434, 35381, 171508, 843419, 4197179, 21094355, 106915928, 545859112, 2804656069, 14491370996, 75248398034, 392476363133, 2055245992376, 10801442696736, 56953957110855, 301207378815752
OFFSET
1,2
REFERENCES
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 75, Eq. (3.5.11).
FORMULA
H. and P. give g.f.
CROSSREFS
Let A063687(n) be the number of 2-trees rooted at a symmetric edge (see H. and P. Eq. (3.5.9)). Then A058866(n) = A058870(n) + A063687(n).
Sequence in context: A329055 A148495 A150221 * A063689 A178325 A087649
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jan 06 2001
EXTENSIONS
More terms from Vladeta Jovovic, Aug 22 2001
STATUS
approved