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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A030058 Least non-sum of divisors of n for some n >= 1. 3

%I #18 Apr 18 2023 09:31:40

%S 2,4,8,13,16,29,32,40,43,57,61,64,73,91,92,97,121,125,128,145,169,181,

%T 187,196,211,218,225,235,249,253,256,281,313,337,361,364,373,379,393,

%U 400,404,435,466,469,481,505,509,512,547,559,561,577,589

%N Least non-sum of divisors of n for some n >= 1.

%C Values appearing in A030057. - _T. D. Noe_, Apr 03 2014

%t 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 Cf. A030057.

%K nonn,nice

%O 1,1

%A _David W. Wilson_

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 1 08:00 EST 2024. Contains 370430 sequences. (Running on oeis4.)