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.
%I A135245 #13 Aug 15 2020 18:53:35 %S A135245 0,0,4,9,0,25,8,49,15,14,21,121,35,169,33,12,55,289,65,361,91,20,85, %T A135245 529,143,46,133,28,187,841,161,961,247,62,253,24,323,1369,217,81,391, %U A135245 1681,341,1849,403,86,493,2209,551,40,481,0,667,2809,533,106,703,68,697,3481 %N A135245 Aliquot predecessors with the largest degrees. %C A135245 Find each node's predecessors in aliquot sequences and choose the node with largest number of predecessors. %C A135245 Climb the aliquot trees on thickest branches (see A135244 = Climb the aliquot trees on shortest paths). %H A135245 Ophir Spector, <a href="/A135245/b135245.txt">Table of n, a(n) for n = 1..150</a> %H A135245 W. Creyaufmueller, <a href="http://www.aliquot.de/aliquote.htm">Aliquot sequences</a> %H A135245 J. O. M. Pedersen, <a href="http://amicable.homepage.dk/tables.htm">Tables of Aliquot Cycles</a> [Broken link] %H A135245 J. O. M. Pedersen, <a href="http://web.archive.org/web/20140502102524/http://amicable.homepage.dk/tables.htm">Tables of Aliquot Cycles</a> [Via Internet Archive Wayback-Machine] %H A135245 J. O. M. Pedersen, <a href="/A063990/a063990.pdf">Tables of Aliquot Cycles</a> [Cached copy, pdf file only] %H A135245 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/AliquotSequence.html">Aliquot sequence</a> %e A135245 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). %Y A135245 Cf. A001065 A005114 A125601 A135244 A057709 A057710 A063769 A080907 A121507 A037020 A126016. %K A135245 nonn %O A135245 1,3 %A A135245 Ophir Spector, ospectoro (AT) yahoo.com, Nov 25 2007