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 A306875 #15 Mar 16 2019 16:09:00
%S A306875 172622505,6217560734,16017860054,18102483014,20021589510,31285993970,
%T A306875 32576024810,39270110990,68700877014,80170395410,81142298930,
%U A306875 99542647490,125182657005,144194617490,153113328654,181335043274,318710758730,374642686418,378482712530,455440763414
%N A306875 Lesser of reduced unitary amicable pair.
%C A306875 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).
%C A306875 The larger members are in A306876.
%H A306875 Amiram Eldar, <a href="/A306875/b306875.txt">Table of n, a(n) for n = 1..28</a> (terms below 10^12, from David Moews's site).
%H A306875 David Moews, <a href="http://djm.cc/amicable.html">Perfect, amicable and sociable numbers</a>
%H A306875 J. O. M. Pedersen, <a href="http://62.198.248.44/aliquot/tables.htm">Tables of Aliquot Cycles</a>
%e A306875 172622505 is in the sequence since it is the lesser of the amicable pair (172622505, 175742294): usigma(172622505) = usigma(175742294) = 348364800 = 172622505 + 175742294 + 1.
%t A306875 us[n_] := Times @@ (1 + Power @@@ FactorInteger[n]) - n; s={}; Do[m = us[n] - 1; If[m > n && us[m] == n + 1, AppendTo[s, n]], {n, 1, 10^9}]; s
%Y A306875 Cf. A003502, A002952, A126172, A034460, A306876.
%K A306875 nonn
%O A306875 1,1
%A A306875 _Amiram Eldar_, Mar 14 2019