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 A354281 #9 May 24 2022 06:14:38
%S A354281 70,4030,5830,9272,17272,243892,351956,407132,1901728,2189024,4199030,
%T A354281 11339816,11547352,12872512,13885970,24450010,31699430,32284330,
%U A354281 34041370,34169630,34315712,38546576,42251930,50761810,67727110,67820390,68000392,72986296,85389368
%N A354281 Weird numbers k such that k-1 is the sum of a subset of the aliquot divisors of k.
%C A354281 There are 17270452 weird numbers below 10^10 and only 68 are in this sequence.
%H A354281 Amiram Eldar, <a href="/A354281/b354281.txt">Table of n, a(n) for n = 1..68</a>
%e A354281 70 is a term since it is a weird number, its aliquot divisors are {1, 2, 5, 7, 10, 14, 35} and 69 = 1 + 2 + 7 + 10 + 14 + 35.
%t A354281 q[n_] := Module[{d = Most @ Divisors[n], x, s, c}, If[Plus @@ d <= n, False, s = Series[Product[1 + x^d[[i]], {i, Length[d]}], {x, 0, n}]; c = SeriesCoefficient[s, #] & /@ (n + {-1, 0}); c[[1]] > 0 && c[[2]] == 0]]; Select[Range[10000], q]
%o A354281 (PARI) is(n, d=divisors(n)[^-1], s=vecsum(d))={s>n && !is_A005835(n, d, s) && is_A005835(n-1, d, s)}; \\ using is_A005835() by _M. F. Hasler_ at A005835
%Y A354281 Subsequence of A006037.
%Y A354281 A354283 is a subsequence.
%Y A354281 Cf. A005835, A354282.
%K A354281 nonn
%O A354281 1,1
%A A354281 _Amiram Eldar_, May 22 2022