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 A064114 #22 Jan 24 2023 02:51:06
%S A064114 70,4030,5390,5830,10430,10570,10990,11410,11690,11830,12110,12530,
%T A064114 12670,13370,13510,13790,13930,14770,15610,15890,16030,16310,16730,
%U A064114 16870,17010,17570,17990,18410,18830,18970,19390,19670,19810,20230,20510,21490,21770,21910
%N A064114 Unitary weird numbers: unitary abundant (A034683) but not unitary pseudoperfect (A293188).
%C A064114 Terms that are not (regular) weird (A006037): 5390, 11830, 17010, 20230, 25270, 37030, 51030, 58870, 67270, 93170, 95830, ... - _Amiram Eldar_, Dec 01 2018
%C A064114 Conjecture: All the terms are divisible by 10 (tested on the first 10^6 terms). - _Amiram Eldar_, Oct 19 2019
%C A064114 The numbers of terms not exceeding 10^k, for k = 1, 2, ..., are , 0, 1, 1, 4, 205, 1680, 14302, 165369, 1682383, 16326260, ... . Apparently, the asymptotic density of this sequence exists and equals 0.0016... . - _Amiram Eldar_, Jan 24 2023
%H A064114 Amiram Eldar, <a href="/A064114/b064114.txt">Table of n, a(n) for n = 1..10000</a>
%e A064114 70 is in the sequence since the sum of its proper unitary divisors, 1, 2, 5, 7, 10, 14, 35 is 74 > 70, yet no subset of these divisors has the sum 74.
%t A064114 udiv[n_] := Select[Divisors[n], GCD[#, n/#] == 1 &]; weirdQ[n_] := Module[{d = Most[udiv[n]]}, If[Total[d] < n, False, c = SeriesCoefficient[Series[Product[1 + x^d[[i]], {i, Length[d]}], {x, 0, n}], n]; c == 0]]; Select[Range[100000], weirdQ] (* _Amiram Eldar_, Dec 01 2018 *)
%Y A064114 Cf. A006037, A034683, A293188.
%K A064114 nonn
%O A064114 1,1
%A A064114 _Naohiro Nomoto_, Sep 08 2001
%E A064114 a(25)-a(38) from _Amiram Eldar_, Dec 01 2018