login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069897 Integer quotient of the largest and the smallest prime factors of n, with a(1) = 1. 4
1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1, 2, 2, 5, 1, 1, 1, 6, 1, 3, 1, 2, 1, 1, 3, 8, 1, 1, 1, 9, 4, 2, 1, 3, 1, 5, 1, 11, 1, 1, 1, 2, 5, 6, 1, 1, 2, 3, 6, 14, 1, 2, 1, 15, 2, 1, 2, 5, 1, 8, 7, 3, 1, 1, 1, 18, 1, 9, 1, 6, 1, 2, 1, 20, 1, 3, 3, 21, 9, 5, 1, 2, 1, 11, 10, 23, 3, 1, 1, 3, 3, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,10
LINKS
FORMULA
a(n) = floor(A006530(n)/A020639(n)).
PROG
(PARI) A069897(n) = if(1==n, 1, my(f = factor(n), lpf = f[1, 1], gpf = f[#f~, 1]); (gpf\lpf)); \\ Antti Karttunen, Sep 07 2018
CROSSREFS
Sequence in context: A274382 A318997 A355662 * A257242 A337908 A325789
KEYWORD
nonn,look
AUTHOR
Labos Elemer, Apr 10 2002
EXTENSIONS
Term a(1) = 1 prepended by Antti Karttunen, Sep 07 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 04:59 EDT 2024. Contains 371264 sequences. (Running on oeis4.)