|
%I #10 Sep 25 2018 20:50:04
%S 0,0,0,0,0,1,0,0,0,1,0,1,0,1,2,0,0,1,0,1,1,1,0,1,0,1,0,1,0,1,0,0,2,1,
%T 2,1,0,1,1,1,0,1,0,1,2,1,0,1,0,1,2,1,0,1,1,1,1,1,0,1,0,1,1,0,3,1,0,1,
%U 2,1,0,1,0,1,2,1,4,1,0,1,0,1,0,1,2,1,2,1,0,1,6,1,1,1,4,1,0,1,2,1,0,1,0,1,1
%N (Largest prime factor of n) modulo (smallest prime factor of n).
%C a(n) = A006530(n) - A069897(n)*A020639(n).
%H Antti Karttunen, <a href="/A069859/b069859.txt">Table of n, a(n) for n = 1..65537</a>
%F a(n) = A006530(n) mod A020639(n).
%t lpfmspf[n_]:=Module[{fs=Transpose[FactorInteger[n]][[1]]},Mod[Last[fs], First[fs]]]; Array[lpfmspf,100] (* _Harvey P. Dale_, Jul 10 2015 *)
%o (PARI) A069859(n) = if(1==n,0, my(f = factor(n), lpf = f[1, 1], gpf = f[#f~, 1]); (gpf%lpf)); \\ _Antti Karttunen_, Sep 25 2018
%Y Cf. A006530, A020639, A046665, A069897.
%K nonn,look
%O 1,15
%A _Reinhard Zumkeller_, Apr 23 2002
%E More terms from _Antti Karttunen_, Sep 25 2018
|
