The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A030058 Least non-sum of divisors of n for some n >= 1. 3
 2, 4, 8, 13, 16, 29, 32, 40, 43, 57, 61, 64, 73, 91, 92, 97, 121, 125, 128, 145, 169, 181, 187, 196, 211, 218, 225, 235, 249, 253, 256, 281, 313, 337, 361, 364, 373, 379, 393, 400, 404, 435, 466, 469, 481, 505, 509, 512, 547, 559, 561, 577, 589 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Values appearing in A030057. - T. D. Noe, Apr 03 2014 LINKS Table of n, a(n) for n=1..53. MATHEMATICA 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 *) CROSSREFS Cf. A030057. Sequence in context: A018442 A292430 A018335 * A346992 A058329 A037380 Adjacent sequences: A030055 A030056 A030057 * A030059 A030060 A030061 KEYWORD nonn,nice AUTHOR David W. Wilson STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 9 03:28 EST 2023. Contains 367681 sequences. (Running on oeis4.)