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 A306868 #17 Mar 16 2019 17:16:18
%S A306868 871585,1388145,1483785,2479065,2580105,4895241,3830625,7336455,
%T A306868 9100905,10350345,16933105,9843526,16367481,24829945,15706090,
%U A306868 18653745,27866241,21080865,15439545,23872185,24401601,32263905,53763535,63075321,41337555,60923577,90245793
%N A306868 Larger of augmented bi-unitary amicable pair.
%C A306868 A pair m < n is an augmented bi-unitary amicable pair if bsigma(m) = bsigma(n) = m + n - 1, where bsigma(n) is the sum of bi-unitary divisors of n (A188999).
%C A306868 The terms are ordered according to their lesser counterparts (A306867).
%H A306868 Amiram Eldar, <a href="/A306868/b306868.txt">Table of n, a(n) for n = 1..509</a> (terms with lesser member below 2*10^11, from David Moews's site).
%H A306868 David Moews, <a href="http://djm.cc/amicable.html">Perfect, amicable and sociable numbers</a>.
%e A306868 871585 is in the sequence since it is the larger of the amicable pair (434784, 871585): bsigma(434784) = bsigma(871585) = 1306368 = 434784 + 871585 - 1.
%t A306868 fun[p_, e_]:=If[OddQ[e], (p^(e+1)-1)/(p-1), (p^(e+1)-1)/(p-1)-p^(e/2)]; bsigma[1] = 1; bsigma[n_] := Times @@ (fun @@@ FactorInteger[n]); f[n_] := bsigma[n] - n + 1; s={}; Do[m = f[n]; If[m > n && f[m] == n, AppendTo[s, m]], {n, 1, 10^7}]; s
%Y A306868 Cf. A015630, A126175, A188999, A292981, A306867.
%K A306868 nonn
%O A306868 1,1
%A A306868 _Amiram Eldar_, Mar 14 2019