|
|
A129087
|
|
Odd doubly abundant numbers (A125639).
|
|
1
|
|
|
11025, 34155, 38745, 39585, 41895, 75735, 85995, 99225, 118755, 131355, 135135, 193725, 208845, 218025, 237195, 241395, 241605, 245385, 255645, 271215, 272745, 275625, 276885, 279279, 306495, 307125, 323505, 342225, 347985, 364455, 377685
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
This sequence contains the odd members of A125639, which (empirically) accounts for only about 0.08% of them.
|
|
LINKS
|
|
|
FORMULA
|
Odd numbers k, such that both k and s(k) (A001065) are abundant (A005101).
|
|
EXAMPLE
|
The third odd number which is doubly abundant is 38745. Hence a(3)=38745.
|
|
MAPLE
|
filter:= proc(n) local s;
s:= numtheory:-sigma(n)-n;
s > n and numtheory:-sigma(s)>2*s
end proc:
select(filter, [seq(i, i=3..400000, 2)]); # Robert Israel, Jun 04 2018
|
|
MATHEMATICA
|
s[n_]:=DivisorSigma[1, n]-n; DoublyAbundantNumberQ[k_]:=If[s[k]>k && s[s[k]]>s[k], True, False]; Select[Range[500000], OddQ[ # ] && DoublyAbundantNumberQ[ # ] & ]
|
|
PROG
|
(PARI) isok(n) = (n%2) && ((s=sigma(n)-n) > n) && (sigma(s) > 2*s); \\ Michel Marcus, Jun 05 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|