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)+1)-full but not (prime(k+1)+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 8, 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/8, 583/5184, 19757609/777600000, ... (see the Formula section).
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
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.27091620709274155136..., 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} 1/prime(j)^i), and S_k is defined in the Comments section.
EXAMPLE
8 = 2^3 is a term since 2 < 3.
9 = 3^2 is not a term since 3 > 2.
MATHEMATICA
Select[Range[2, 125000], 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
