This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A069859 #10 Sep 25 2018 20:50:04
%S A069859 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 A069859 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 A069859 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 A069859 (Largest prime factor of n) modulo (smallest prime factor of n).
%C A069859 a(n) = A006530(n) - A069897(n)*A020639(n).
%H A069859 Antti Karttunen, <a href="/A069859/b069859.txt">Table of n, a(n) for n = 1..65537</a>
%F A069859 a(n) = A006530(n) mod A020639(n).
%t A069859 lpfmspf[n_]:=Module[{fs=Transpose[FactorInteger[n]][[1]]},Mod[Last[fs], First[fs]]]; Array[lpfmspf,100] (* _Harvey P. Dale_, Jul 10 2015 *)
%o A069859 (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 A069859 Cf. A006530, A020639, A046665, A069897.
%K A069859 nonn,look
%O A069859 1,15
%A A069859 _Reinhard Zumkeller_, Apr 23 2002
%E A069859 More terms from _Antti Karttunen_, Sep 25 2018