Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Aug 12 2023 00:50:04
%S 70,836,2704,2744,4030,5530,5810,5830,6230,6790,7070,7192,7210,7490,
%T 7630,7910,7912,8890,9170,9272,9590,9730,10430,10570,10792,10990,
%U 11410,11690,12110,12530,12670,13370,13510,13790,13930,14770,15610,15890,16030,16310,16730
%N S-weird numbers: S-abundant numbers (A181487) k such that no subset of the aliquot divisors of k that are in the set S sums to k, where S is the set defined in A118372.
%C Analogous to weird numbers (A006037) as S-perfect numbers (A118372) are analogous to perfect numbers (A000396) and S-abundant numbers (A181487) are analogous to abundant numbers (A005101).
%C Apparently, includes all the weird numbers (verified for all terms below 5*10^7). It also includes additional terms: 2704, 2744, 5530, 5810, 6230, 6790, 7070, 7210, 7490, ... .
%H Amiram Eldar, <a href="/A364862/b364862.txt">Table of n, a(n) for n = 1..10000</a>
%t weirdQ[n_, d_] := If[Total[d] <= n, False, SeriesCoefficient[Series[Product[1 + x^d[[i]], {i, Length[d]}], {x, 0, n}], n] == 0];
%t S = {1}; Sweird = {}; Do[s = Total[(d = Intersection[S, Divisors[n]])]; If[s <= n, AppendTo[S, n], If[weirdQ[n, d], AppendTo[Sweird, n]]], {n, 2, 10^4}]; Sweird
%Y Subsequence of A181487.
%Y Cf. A000396, A005101, A006037, A118372.
%K nonn
%O 1,1
%A _Amiram Eldar_, Aug 11 2023