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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A006039 Primitive non-deficient numbers. (Formerly M4132) 19
 6, 20, 28, 70, 88, 104, 272, 304, 368, 464, 496, 550, 572, 650, 748, 836, 945, 1184, 1312, 1376, 1430, 1504, 1575, 1696, 1870, 1888, 1952, 2002, 2090, 2205, 2210, 2470, 2530, 2584, 2990, 3128, 3190, 3230, 3410, 3465, 3496, 3770, 3944, 4030 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS A number n is non-deficient (A023196) iff it is abundant or perfect, that is iff A001065(n) is >= n. Since any multiple of a non-deficient number is itself non-deficient, we call a non-deficient number primitive iff all its proper divisors are deficient. - Jeppe Stig Nielsen, Nov 23 2003 Numbers whose proper multiples are all abundant, and whose proper divisors are all deficient. - Peter Munn, Sep 08 2020 As a set, shares with the sets of k-almost primes this property: no member divides another member and each positive integer not in the set is either a divisor of 1 or more members of the set or a multiple of 1 or more members of the set, but not both. See A337814 for proof etc. - Peter Munn, Apr 13 2022 REFERENCES N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). LINKS T. D. Noe, Table of n, a(n) for n = 1..8671 L. E. Dickson, Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors, Amer. J. Math., 35 (1913), 413-426. Jared Duker Lichtman, The reciprocal sum of primitive nondeficient numbers, Journal of Number Theory, Vol. 191 (2018), pp. 104-118. FORMULA Union of A000396 (perfect numbers) and A071395 (primitive abundant numbers). - M. F. Hasler, Jul 30 2016 Sum_{n>=1} 1/a(n) is in the interval (0.34842, 0.37937) (Lichtman, 2018). - Amiram Eldar, Jul 15 2020 MATHEMATICA k = 1; lst = {}; While[k < 4050, If[DivisorSigma[1, k] >= 2 k && Min@Mod[k, lst] > 0, AppendTo[lst, k]]; k++]; lst (* Robert G. Wilson v, Mar 09 2017 *) CROSSREFS Cf. A001065 (aliquot function), A023196 (non-deficient), A005101 (abundant), A091191. Subsequences: A000396 (perfect), A071395 (primitive abundant), A006038 (odd primitive abundant), A333967, A352739. Cf. A337814, A338133 (sorted by largest prime factor), A338427 (largest prime(n)-smooth). Sequence in context: A324643 A119425 A342669 * A180332 A338133 A064771 Adjacent sequences:  A006036 A006037 A006038 * A006040 A006041 A006042 KEYWORD nonn AUTHOR 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 November 26 05:48 EST 2022. Contains 358353 sequences. (Running on oeis4.)