OFFSET
1,1
COMMENTS
Numbers k such that there is a prime factor p of k such that gpf(k+p) != p.
Numbers k such that there is a prime factor p of k such that k+p is not p-smooth.
LINKS
Jianing Song, Table of n, a(n) for n = 1..7946 (all terms <= 10000)
EXAMPLE
57 is a term since the prime factors of 57 are 3,19, and we have gpf(57+3) != 3.
PROG
(PARI) gpf(n) = vecmax(factor(n)[, 1]);
isA354526(n) = my(f=factor(n)[, 1]); for(i=1, #f, if(gpf(n+f[i])!=f[i], return(1))); 0
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Jianing Song, Aug 16 2022
STATUS
approved