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 A030058 #18 Apr 18 2023 09:31:40
%S A030058 2,4,8,13,16,29,32,40,43,57,61,64,73,91,92,97,121,125,128,145,169,181,
%T A030058 187,196,211,218,225,235,249,253,256,281,313,337,361,364,373,379,393,
%U A030058 400,404,435,466,469,481,505,509,512,547,559,561,577,589
%N A030058 Least non-sum of divisors of n for some n >= 1.
%C A030058 Values appearing in A030057. - _T. D. Noe_, Apr 03 2014
%t A030058 nmax = 100; terms = 53; notSum[n_] := notSum[n] = First[Complement[Range[ DivisorSigma[1, n] + 1], Total /@ Subsets[Divisors[n]]]]; seq0 = {}; While[u = Union[Table[notSum[n], {n, 1, nmax}]]; seq = Take[u, Min[terms, Length[u]]]; seq != seq0, seq0 = seq; Print[nmax]; nmax = nmax + 50]; A030058 = seq (* _Jean-François Alcover_, Oct 10 2016 *)
%Y A030058 Cf. A030057.
%K A030058 nonn,nice
%O A030058 1,1
%A A030058 _David W. Wilson_