cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A358107 Number of unlabeled trees covering 2n nodes, n+1 of which are leaves.

This page as a plain text file.
%I A358107 #17 Jan 02 2023 15:25:24
%S A358107 1,1,2,6,26,119,626,3495,20688,127339,810418,5293790,35351571,
%T A358107 240478715,1662071181,11646620758,82601643511,592110678762,
%U A358107 4284830131865,31271691087861,229980550743717,1703097703162249,12691879796699486,95129358337729084,716801612475691847
%N A358107 Number of unlabeled trees covering 2n nodes, n+1 of which are leaves.
%H A358107 Andrew Howroyd, <a href="/A358107/b358107.txt">Table of n, a(n) for n = 1..100</a>
%H A358107 Gus Wiseman, <a href="/A358107/a358107_1.png">The a(4) = 6 trees covering 8 nodes, 5 of which are leaves</a>.
%Y A358107 Central column of A055290.
%Y A358107 The labeled version is the central column of A055314.
%Y A358107 For n leaves we have A359398.
%Y A358107 A000272 counts trees, bisection A163395, unlabeled A000055.
%Y A358107 A001187 counts connected graphs, unlabeled A001349.
%Y A358107 A006125 counts graphs, unlabeled A000088.
%Y A358107 A006129 counts covering graphs, unlabeled A002494.
%Y A358107 A014068 counts graphs with n vertices and n-1 edges, unordered A001433.
%Y A358107 Cf. A185650, A358732.
%K A358107 nonn
%O A358107 1,3
%A A358107 _Gus Wiseman_, Dec 02 2022
%E A358107 Terms a(11) and beyond from _Andrew Howroyd_, Jan 01 2023