|
|
A308127
|
|
Non-coreful abundant numbers: numbers k such that ncsigma(k) > k, where ncsigma(k) is the sum of the non-coreful divisors of k (A308135).
|
|
4
|
|
|
30, 42, 60, 66, 70, 78, 84, 90, 102, 114, 120, 126, 132, 138, 150, 156, 168, 174, 180, 186, 198, 210, 222, 240, 246, 258, 270, 282, 294, 300, 318, 330, 336, 354, 366, 378, 390, 402, 420, 426, 438, 450, 462, 474, 480, 498, 510, 534, 546, 570, 582, 606, 618, 630
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Non-coreful divisor d of a number k is a divisor such that rad(d) != rad(k), where rad(k) is the largest squarefree divisor of k (A007947).
|
|
LINKS
|
G. E. Hardy and M. V. Subbarao, Highly powerful numbers, Congress. Numer., Vol. 37 (1983), pp. 277-307. (Annotated scanned copy)
|
|
EXAMPLE
|
60 is in the sequence since its non-coreful divisors are 1, 2, 3, 4, 5, 6, 10, 12, 15, and 20 whose sum is 78 > 60.
|
|
MAPLE
|
with(numtheory): P:=proc(k) local a, n; a:=mul(n, n=factorset(k));
if sigma(k)-a*sigma(k/a)>k then k; fi; end: seq(P(i), i=1..630);
|
|
MATHEMATICA
|
f[p_, e_] := (p^(e + 1) - 1)/(p - 1); fc[p_, e_] := f[p, e] - 1; ncAbQ[n_] := Times @@ (f @@@ FactorInteger[n]) - Times @@ (fc @@@ FactorInteger[n]) > n; Select[Range[2, 1000], ncAbQ]
|
|
PROG
|
(PARI) rad(n) = factorback(factorint(n)[, 1]); \\ A007947
s(n) = my(r=rad(n)); sumdiv(n, d, if (rad(d)!=r, d));
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|