login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A357685
Numbers k such that A293228(k) > k.
3
30, 42, 60, 66, 70, 78, 84, 102, 114, 132, 138, 140, 156, 174, 186, 204, 210, 222, 228, 246, 258, 276, 282, 318, 330, 348, 354, 366, 372, 390, 402, 420, 426, 438, 444, 462, 474, 492, 498, 510, 516, 534, 546, 564, 570, 582, 606, 618, 636, 642, 654, 660, 678, 690
OFFSET
1,1
COMMENTS
The numbers of terms not exceeding 10^k, for k = 2, 3, ..., are 7, 79, 843, 8230, 83005, 826875, 8275895, 82790525, 827718858, 8276571394, ... . Apparently, the asymptotic density of this sequence exists and equals 0.0827... .
LINKS
EXAMPLE
30 is a term since its aliquot squarefree divisors are {1, 2, 3, 5, 6, 10, 15} and their sum is 42 > 30.
60 is a term since its aliquot squarefree divisors are {1, 2, 3, 5, 6, 10, 15, 30} and their sum is 72 > 60.
MATHEMATICA
s[n_] := Times @@ (1 + (f = FactorInteger[n])[[;; , 1]]) - If[AllTrue[f[[;; , 2]], # == 1 &], n, 0]; Select[Range[2, 1000], s[#] > # &]
PROG
(PARI) is(n) = {my(f = factor(n), s); s = prod(i=1, #f~, f[i, 1]+1); if(n==1 || vecmax(f[, 2]) == 1, s -= n); s > n};
CROSSREFS
Disjoint union of A087248 and A357686.
Subsequence of A005101.
Sequence in context: A360525 A308127 A349794 * A091454 A376862 A175727
KEYWORD
nonn
AUTHOR
Amiram Eldar, Oct 09 2022
STATUS
approved