OFFSET
0,1
COMMENTS
a(n) is the largest leaf-node among the finite subtrees branching from node n in the infinite trunk (A259934) of the tree generated by edge-relation A049820(child) = parent, and A259934(n) itself if it is one of the nonbranching nodes (A262897).
Note that without (so far undetected) regularity in A262509, there is no a priori upper bound for the value of a(n), and for some n this might not even be finite, if it happens that contrary to its conjectured nature, A259934 is not the unique infinite component, but just the lexicographically earliest instance of multiple infinite branches of the tree. In that case we might consider this sequence to be well-defined only up to the least such node branching to multiple infinite components, or alternatively, we might mark the nonfinite values at those points with -1.
LINKS
Antti Karttunen, Table of n, a(n) for n = 0..10000
Max Alekseyev & Antti Karttunen, Standalone C++-program for computing this sequence
FORMULA
PROG
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Oct 06 2015
STATUS
approved