OFFSET
1,5
COMMENTS
A "peerless" tree is an unlabeled, unrooted tree (as in A000055) with the property that if two nodes are joined by an edge then these nodes have different degrees.
Victor S. Miller reports that this sequence was first proposed on Project Euler.
In fact, Peter J. Taylor defined a class of trees for the Project Euler question in order that it wouldn't have any spoilers in OEIS. Frūstrā! - Peter J. Taylor, Nov 18 2025
Comment from Brendan McKay, May 01 2025 (Start)
The enumeration could be extended by the following argument.
If the tree has a unique centroid (not center!) then removing the centroid gives rooted subtrees of size less than n/2. If there are two centroids, they are adjacent and removing that edge gives two rooted subtrees with exactly n/2 vertices.
Start by making all rooted trees up to n/2 vertices which have no adjacent vertices of the same degree, not counting adjacencies of the root. Then classify them according to which degrees the root can be increased to without violating this condition for edges adjacent to the root.
With this information the counts for n vertices can be reconstructed. In this way getting up past 60 vertices should be possible. (End)
This sequence forms the left-most column of A383448.
LINKS
Victor Miller and others, Peerless trees, Seqfan, 2025.
Project Euler, Problem 936: Peerless Trees.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, May 01 2025, based on postings to the SeqFan Mailing List in April and May 2025 by Victor S. Miller, Allan C. Wechsler, Brendan McKay, and others
EXTENSIONS
a(1)-a(8) were computed by Allan C. Wechsler, Apr 30 2025, and a(9)-a(34) by Brendan McKay, May 02 2025.
STATUS
approved