OFFSET
0,1
COMMENTS
a(n) = number of iterations of A262686 needed before zero is reached. In the context of tree (A263267) defined by edge-relation A049820(child) = parent, this is the number of hops we make before reaching one of the leaves (A045765), when we start from n and always select the largest child at each iteration.
LINKS
Antti Karttunen, Table of n, a(n) for n = 0..10000
FORMULA
PROG
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 29 2015
STATUS
approved