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 A292986 #13 Mar 25 2023 05:27:51
%S A292986 70,4030,5390,5830,7192,7400,7912,9272,10430,10570,10792,10990,11410,
%T A292986 11690,11830,12110,12530,12670,13370,13510,13790,13930,14770,15610,
%U A292986 15890,16030,16310,16730,16870,17272,17570,17990,18410,18830,18970,19390,19670,19810
%N A292986 Bi-unitary weird numbers: bi-unitary abundant numbers (A292982) that are not bi-unitary pseudoperfect (A292985).
%C A292986 Analogous to weird numbers (A006037) with bi-unitary sigma (A188999) instead of sigma (A000203).
%H A292986 Amiram Eldar, <a href="/A292986/b292986.txt">Table of n, a(n) for n = 1..10000</a>
%t A292986 f[n_] := Select[Divisors[n], Function[d, CoprimeQ[d, n/d]]]; bdiv[m_] := Select[Divisors[m], Last@Intersection[f@#, f[m/#]] == 1 &]; bsigma[m_] := DivisorSum[m, # &, Last@Intersection[f@#, f[m/#]] == 1 &]; bAbundantQ[n_] := bsigma[n] > 2 n; a = {}; n = 0; While[Length[a] < 5, n++; If[!bAbundantQ[n], Continue[]]; d = Most[bdiv[n]]; c = SeriesCoefficient[Series[Product[1 + x^d[[i]], {i, Length[d]}], {x, 0, n}], n]; If[c <= 0, AppendTo[a, n]]]; a (* after _T. D. Noe_ at A005835 and _Michael De Vlieger_ at A188999 *)
%Y A292986 Cf. A006037, A064114, A188999, A292982, A292985.
%K A292986 nonn
%O A292986 1,1
%A A292986 _Amiram Eldar_, Sep 27 2017