This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A069859 (Largest prime factor of n) modulo (smallest prime factor of n). 3
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,15 COMMENTS a(n) = A006530(n) - A069897(n)*A020639(n). LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 FORMULA a(n) = A006530(n) mod A020639(n). MATHEMATICA lpfmspf[n_]:=Module[{fs=Transpose[FactorInteger[n]][[1]]}, Mod[Last[fs], First[fs]]]; Array[lpfmspf, 100] (* Harvey P. Dale, Jul 10 2015 *) PROG (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 CROSSREFS Cf. A006530, A020639, A046665, A069897. Sequence in context: A089224 A325122 A234578 * A179317 A307598 A324967 Adjacent sequences:  A069856 A069857 A069858 * A069860 A069861 A069862 KEYWORD nonn,look AUTHOR Reinhard Zumkeller, Apr 23 2002 EXTENSIONS More terms from Antti Karttunen, Sep 25 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 20 01:17 EDT 2019. Contains 325168 sequences. (Running on oeis4.)