proposed
approved
proposed
approved
editing
proposed
Amiram Eldar, <a href="/A360356/b360356.txt">Table of n, a(n) for n = 1..10000</a>
approved
editing
proposed
approved
editing
proposed
Analogous to primitive abundant numbers (A091191) with divisors that are restricted to numbers that have only nonprime-indexed prime factors.
56, 104, 196, 304, 364, 368, 464, 532, 644, 812, 1036, 1184, 1204, 1316, 1376, 1484, 1504, 1696, 1708, 1952, 1988, 2044, 2212, 2492, 2716, 2828, 2884, 2996, 3164, 3496, 3668, 3836, 3892, 4172, 4228, 4408, 4544, 4564, 4672, 4676, 4844, 5056, 5068, 5336, 5404, 5516
1,1
f[p_, e_] := If[PrimeQ[PrimePi[p]], 1, (p^(e + 1) - 1)/(p - 1)]; s[1] = 1; s[n_] := Times @@ f @@@ FactorInteger[n]; primQ[n_] := s[n] > 2*n && AllTrue[Divisors[n], # == n || s[#] <= 2*# &]; Select[Range[6000], primQ]
(PARI) isab(n) = {my(f = factor(n), p = f[, 1], e = f[, 2]); prod(i = 1, #p, if(isprime(primepi(p[i])), 1, (p[i]^(e[i]+1)-1)/(p[i]-1))) > 2*n; }
is(n) = {if(!isab(n), return(0)); fordiv(n, d, if(d < n && isab(d), return(0))); return(1)};
allocated
nonn
Amiram Eldar, Feb 04 2023
approved
editing
allocated for Amiram Eldar
allocated
approved