OFFSET
1,1
COMMENTS
The asymptotic density of this sequence is Product_{p primes} (1 - 1/p^5 + 1/p^6) * (s(1)^3 + 3*s(1)*s(2) + 2*s(3)) / 6 = 1.38560245036673575581*10^(-8), where s(m) = (-1)^(m-1) * Sum_{p prime} (1/(p^6/(p-1)-1))^m (Elma and Martin, 2024).
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
Ertan Elma and Greg Martin, Distribution of the number of prime factors with a given multiplicity, Canadian Mathematical Bulletin, Vol. 67, No. 4 (2024), pp. 1107-1122; arXiv preprint, arXiv:2406.04574 [math.NT], 2024.
MAPLE
M:= 10^10: # for terms <= M
B:= select(t -> ifactors(t)[2][.., 2]=[1, 1, 1], [$1..floor(M^(1/5))]):
R:= NULL:
for i from 1 to nops(B) do
Q:= select(t -> igcd(t, B[i]) = 1 and not member(5, ifactors(t)[2][.., 2]), [$1 .. M/B[i]^5]);
R:= R, op(B[i]^5 * Q);
od:
sort([R]); # Robert Israel, Aug 03 2025
MATHEMATICA
seq[lim_] := Module[{s = {}, sqfs = Select[Range[Surd[lim, 5]], SquareFreeQ[#] && PrimeNu[#] == 3 &]}, Do[s = Join[s, sqf^5 * Select[Range[lim/sqf^5], CoprimeQ[#, sqf] && !MemberQ[FactorInteger[#][[;; , 2]], 5] &]], {sqf, sqfs}]; Union[s]]; seq[2*10^9]
PROG
(PARI) isok(k) = vecsum(apply(x -> if(x == 5, 1, 0), factor(k)[, 2])) == 3;
CROSSREFS
Numbers that have exactly three exponents in their prime factorization that are equal to k: A386798 (k=2), A386802 (k=3), A386806 (k=4), this sequence (k=5).
KEYWORD
nonn,easy
AUTHOR
Amiram Eldar, Aug 03 2025
STATUS
approved
