Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #18 Aug 17 2022 05:07:05
%S 1,4,8,12,16,18,27,32,36,48,50,54,60,64,72,80,81,84,90,96,100,108,112,
%T 125,128,132,135,144,147,150,160,162,176,180,192,196,198,200,208,210,
%U 216,224,225,234,242,243,250,252,256,270,275,280,288,294,300,306,320,324
%N Numbers k such that m - gpf(m) = k has no solution m >= 2, gpf = A006530.
%C Numbers k such that there is no prime p such that gpf(k+p) = p.
%C Numbers k such that there is no prime factor p of k such that k+p is p-smooth.
%H Jianing Song, <a href="/A354515/b354515.txt">Table of n, a(n) for n = 1..9826</a> (all terms <= 80000)
%e 12 is a term since the prime factors of 12 are 2,3, and we have gpf(12+2) != 2 and gpf(12+3) != 3.
%o (PARI) gpf(n) = vecmax(factor(n)[, 1]);
%o isA354515(n) = if(n, my(f=factor(n)[, 1]); for(i=1, #f, if(gpf(n+f[i])==f[i], return(0))); 1, 0)
%Y Cf. A006530, A076563.
%Y Indices of 0 in A354512. Complement of A354514.
%K nonn,easy
%O 1,2
%A _Jianing Song_, Aug 16 2022