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”).

A378673
Numbers of not uniquely embeddable trees on n vertices.
1
0, 0, 0, 0, 0, 0, 1, 4, 16, 49, 140, 390
OFFSET
1,8
LINKS
Eric Weisstein's World of Mathematics, Uniquely Embeddable Graph.
Eric Weisstein's World of Mathematics, Tree.
FORMULA
a(n) = A000055(n) - A378672(n).
CROSSREFS
Cf. A378672 (uniquely embeddable trees).
Cf. A372853 (uniquely embeddable planar connected graphs).
Cf. A000055 (trees).
Sequence in context: A224147 A227266 A114185 * A188516 A188501 A283692
KEYWORD
nonn,more,new
AUTHOR
Eric W. Weisstein, Dec 03 2024
STATUS
approved