OFFSET
1,3
COMMENTS
Find each node's predecessors in aliquot sequences and choose the node with largest number of predecessors.
Climb the aliquot trees on thickest branches (see A135244 = Climb the aliquot trees on shortest paths).
LINKS
Ophir Spector, Table of n, a(n) for n = 1..150
W. Creyaufmueller, Aliquot sequences
J. O. M. Pedersen, Tables of Aliquot Cycles [Broken link]
J. O. M. Pedersen, Tables of Aliquot Cycles [Via Internet Archive Wayback-Machine]
J. O. M. Pedersen, Tables of Aliquot Cycles [Cached copy, pdf file only]
Eric Weisstein's World of Mathematics, Aliquot sequence
EXAMPLE
a(25) = 143 since 25 has 3 predecessors (95,119,143) with degrees (4,5,7), 143 having the largest degree. a(5) = 0 since it has no predecessors (see Untouchables - A005114).
CROSSREFS
KEYWORD
nonn
AUTHOR
Ophir Spector, ospectoro (AT) yahoo.com, Nov 25 2007
STATUS
approved