OFFSET
1,1
COMMENTS
Disjoint union of the sequences S_k, k >= 1, where S_k is the sequence of p-smooth numbers (numbers whose prime factors are all less than or equal to p), with p = prime(k), that are prime(k)-full but not prime(k+1)-full numbers (k-full numbers are numbers whose prime factorization exponents are all larger than or equal to k). S_1 contains only the term 4, and S_k is infinite for k >= 2. The sum of the reciprocals of the terms of S_k is rational for all k: 1/4, 649/2592, 61992313/1166400000, ... (see the Formula section).
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..5416 (terms below 10^18)
Eric Weisstein's World of Mathematics, Smooth Number.
Wikipedia, Powerful number: Generalization (k-full number).
Wikipedia, Smooth number.
FORMULA
Sum_{n>=1} 1/a(n) = Sum_{k>=1} f(k) = 0.56987350769329353172..., where f(k) = Sum_{i>=1} 1 / S_k(i) = g(prime(k), k) - g(prime(k+1), k), g(p, k) = Product_{j=1..k} (1 + Sum_{i >= p} 1/prime(j)^i), and S_k is defined in the Comments section.
MAPLE
filter:= proc(n) local F;
F:= ifactors(n)[2];
max(F[.., 1]) <= min(F[.., 2])
end proc:
select(filter, [$2..50000]); # Robert Israel, Jan 31 2025
MATHEMATICA
Select[Range[2, 33000], Module[{f = FactorInteger[#]}, f[[-1, 1]] <= Min[f[[;; , 2]]]] &]
PROG
(PARI) isok(k) = if(k == 1, 0, my(f = factor(k), e = f[, 2]); f[#f~, 1] <= vecmin(e));
CROSSREFS
KEYWORD
nonn
AUTHOR
Amiram Eldar, Jan 31 2025
STATUS
approved