|
|
A091191
|
|
Primitive abundant numbers: abundant numbers (A005101) having no abundant proper divisor.
|
|
46
|
|
|
12, 18, 20, 30, 42, 56, 66, 70, 78, 88, 102, 104, 114, 138, 174, 186, 196, 222, 246, 258, 272, 282, 304, 308, 318, 354, 364, 366, 368, 402, 426, 438, 464, 474, 476, 498, 532, 534, 550, 572, 582, 606, 618, 642, 644, 650, 654, 678, 748, 762, 786, 812, 822
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
This is a supersequence of the primitive abundant number sequence A071395, since many of these numbers will be positive integer multiples of the perfect numbers (A000396). - Timothy L. Tiffin, Jul 15 2016
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
12 is a term since 1, 2, 3, 4, and 6 (the proper divisors of 12) are either deficient or perfect numbers, and thus not abundant. - Timothy L. Tiffin, Jul 15 2016
|
|
MAPLE
|
isA005101 := proc(n) is(numtheory[sigma](n) > 2*n ); end proc:
isA091191 := proc(n) local d; if isA005101(n) then for d in numtheory[divisors](n) minus {1, n} do if isA005101(d) then return false; end if; end do: return true; else false; end if; end proc:
for n from 1 to 200 do if isA091191(n) then printf("%d\n", n) ; end if; end do: # R. J. Mathar, Mar 28 2011
|
|
MATHEMATICA
|
t = {}; n = 1; While[Length[t] < 100, n++; If[DivisorSigma[1, n] > 2*n && Intersection[t, Divisors[n]] == {}, AppendTo[t, n]]]; t (* T. D. Noe, Mar 28 2011 *)
Select[Range@ 840, DivisorSigma[1, #] > 2 # && Times @@ Boole@ Map[DivisorSigma[1, #] <= 2 # &, Most@ Divisors@ #] == 1 &] (* Michael De Vlieger, Jul 16 2016 *)
|
|
PROG
|
(Haskell)
a091191 n = a091191_list !! (n-1)
a091191_list = filter f [1..] where
f x = sum pdivs > x && all (<= 0) (map (\d -> a000203 d - 2 * d) pdivs)
where pdivs = a027751_row x
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|