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 A364728 #8 Aug 05 2023 13:17:01
%S A364728 1,2,3,4,5,6,7,8,9,10,11,13,14,15,16,17,18,19,21,22,23,25,26,27,28,29,
%T A364728 31,33,34,35,37,38,39,41,43,45,46,47,48,49,51,53,55,57,58,59,61,63,65,
%U A364728 67,69,71,73,75,77,79,81,83,85,87,89,91,93,95,97,99,101
%N A364728 Numbers that are not the sum of admirable numbers (not necessarily distinct).
%C A364728 First differs from A053460 at n = 39.
%C A364728 _Giovanni Resta_ found that 1003 is the largest number that is not a sum of admirable numbers.
%H A364728 Amiram Eldar, <a href="/A364728/b364728.txt">Table of n, a(n) for n = 1..504</a> (complete sequence)
%H A364728 Giovanni Resta, <a href="http://www.numbersaplenty.com/set/admirable_number">admirable numbers</a>, Numbers Aplenty.
%t A364728 admQ[n_] := (ab = DivisorSigma[1, n] - 2 n) > 0 && EvenQ[ab] && ab/2 < n && Divisible[n, ab/2];
%t A364728 With[{adm = Select[Range[1200], admQ]}, Position[Rest[CoefficientList[Series[Product[(1 + x^adm[[k]]), {k, 1, Length[adm]}], {x, 0, adm[[-1]]}], x]], 0] // Flatten]
%Y A364728 Cf. A053460, A111592.
%Y A364728 Analogous sequence with abundant numbers: A283550.
%K A364728 nonn,fini,full
%O A364728 1,2
%A A364728 _Amiram Eldar_, Aug 05 2023