|
%I #8 Aug 18 2015 09:20:29
%S 2,3,4,5,3,7,8,3,5,11,6,13,7,5,16,17,6,19,5,7,11,23,3,5,13,9,7,29,10,
%T 31,32,11,17,7,12,37,19,13,5,41,7,43,11,5,23,47,6,7,10,17,13,53,18,11,
%U 7,19,29,59,15,61,31,7,64,13,11,67,17,23,14,71,9,73,37,5,19,11,13,79
%N Smallest s > 0 such that Lpf(n) = Lpf(n+s) where Lpf(x) denotes the largest prime factor in x factorization.
%t ss[n_]:=Module[{s=1,f=FactorInteger[n][[-1,1]]},While[f!=FactorInteger[ s+n][[-1,1]], s++];s]; Array[ss,80,2] (* _Harvey P. Dale_, Aug 18 2015 *)
%o (PARI) for(n=2,120,s=+1; while(abs(component(component(factor(n),1),omega(n))-component(component(factor(n+s),1),omega(n+s)))>0,s++); print1(s,","))
%K easy,nonn
%O 1,1
%A _Benoit Cloitre_, Jun 08 2002
|
