|
Search: id:A006039
|
|
|
| A006039 |
|
Primitive non-deficient numbers.
(Formerly M4132)
|
|
+0
2
|
|
| 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; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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 (mail(AT)jeppesn.dk), Nov 23 2003
|
|
REFERENCES
|
L. E. Dickson, Amer. J. Math., 35 (1913), 413-426.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n = 1..8671
|
|
CROSSREFS
|
Cf. A001065 (aliquot function), A023196 (non-deficient numbers), A005101 (abundant numbers), A000396 (perfect numbers), A005231 (odd abundant numbers), A006038 (odd primitive abundant numbers).
Adjacent sequences: A006036 A006037 A006038 this_sequence A006040 A006041 A006042
Sequence in context: A044970 A090502 A119425 this_sequence A064771 A006036 A140738
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, R. K. Guy
|
|
|
Search completed in 0.002 seconds
|
