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 A306876 #17 Mar 16 2019 17:00:39
%S A306876 175742294,6263852385,16082297385,18625120185,32553626105,38947446285,
%T A306876 37626449685,41194817265,103052922665,87988279533,103552755405,
%U A306876 126755126589,131943742994,192245655405,226960409585,181521732405,502566224565,399451768365,403080683565,461943100905
%N A306876 Larger of reduced unitary amicable pair.
%C A306876 A pair m < n is a reduced unitary amicable pair if usigma(m) = usigma(n) = m + n + 1, where usigma(n) is the sum of unitary divisors of n (A034460). The terms are ordered according to their lesser counterparts (A306875).
%H A306876 Amiram Eldar, <a href="/A306876/b306876.txt">Table of n, a(n) for n = 1..28</a> (terms with lesser member below 10^12, from David Moews's site).
%H A306876 David Moews, <a href="http://djm.cc/amicable.html">Perfect, amicable and sociable numbers</a>
%H A306876 J. O. M. Pedersen, <a href="http://62.198.248.44/aliquot/tables.htm">Tables of Aliquot Cycles</a>
%e A306876 175742294 is in the sequence since it is the larger of the amicable pair (172622505, 175742294): usigma(172622505) = usigma(175742294) = 348364800 = 172622505 + 175742294 + 1.
%t A306876 us[n_] := Times @@ (1 + Power @@@ FactorInteger[n]) - n; s={}; Do[m = us[n] - 1; If[m > n && us[m] == n + 1, AppendTo[s, m]], {n, 1, 10^9}]; s
%Y A306876 Cf. A003503, A002953, A126173, A034460, A306875.
%K A306876 nonn
%O A306876 1,1
%A A306876 _Amiram Eldar_, Mar 14 2019