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”).
%I #9 Dec 03 2024 12:20:56
%S 1,1,1,2,3,6,10,19,31,57,95,161
%N Numbers of uniquely embeddable trees on n vertices.
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/UniquelyEmbeddableGraph.html">Uniquely Embeddable Graph</a>.
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Tree.html">Tree</a>.
%F a(n) = A000055(n) - A378673(n).
%Y Cf. A378673 (uniquely embeddable trees).
%Y Cf. A372853 (uniquely embeddable planar connected graphs).
%Y Cf. A000055 (trees).
%K nonn,more,new
%O 1,4
%A _Eric W. Weisstein_, Dec 03 2024