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 A306872 #16 Mar 16 2019 15:28:08
%S A306872 6224890,37542190,56523810,101304490,135657795,233990890,5304907426,
%T A306872 8473747030,8483430670,9220653310,11033448910,12139959910,13108452735,
%U A306872 13849730895,16697472870,19644687195,20321234206,23076788295,40575765615,55636542346,89094853155,101786530846
%N A306872 Lesser of augmented unitary amicable pair.
%C A306872 A pair m < n is an augmented unitary amicable pair if usigma(m) = usigma(n) = m + n - 1, where usigma(n) is the sum of unitary divisors of n (A034460).
%C A306872 The larger members are in A306873.
%H A306872 Amiram Eldar, <a href="/A306872/b306872.txt">Table of n, a(n) for n = 1..27</a> (terms below 10^12, from David Moews's site).
%H A306872 David Moews, <a href="http://djm.cc/amicable.html">Perfect, amicable and sociable numbers</a>
%H A306872 J. O. M. Pedersen, <a href="http://62.198.248.44/aliquot/tables.htm">Tables of Aliquot Cycles</a>
%e A306872 6224890 is in the sequence since it is the lesser of the amicable pair (6224890, 7336455): usigma(6224890) = usigma(7336455) = 13561344 = 6224890 + 7336455 - 1.
%t A306872 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 A306872 Cf. A002952, A007992, A034460, A126174, A306873.
%K A306872 nonn
%O A306872 1,1
%A A306872 _Amiram Eldar_, Mar 14 2019