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!)
A083716 a(n) = integer part of (greatest prime <= n)/(greatest prime factor of n); a(1) = 1. 5
1, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 3, 1, 1, 2, 6, 1, 5, 1, 3, 2, 1, 1, 7, 4, 1, 7, 3, 1, 5, 1, 15, 2, 1, 4, 10, 1, 1, 2, 7, 1, 5, 1, 3, 8, 1, 1, 15, 6, 9, 2, 3, 1, 17, 4, 7, 2, 1, 1, 11, 1, 1, 8, 30, 4, 5, 1, 3, 2, 9, 1, 23, 1, 1, 14, 3, 6, 5, 1, 15, 26, 1, 1, 11, 4, 1, 2, 7, 1, 17, 6, 3, 2, 1, 4, 29, 1, 13, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,8
COMMENTS
a(n) = floor(A007917(n)/A006530(n));
a(p) = 1 for primes p.
LINKS
MAPLE
1, seq(floor(prevprime(n+1)/max(numtheory:-factorset(n))), n=2..100); # Robert Israel, Jun 13 2017
MATHEMATICA
a[n_] := If[n == 1 || PrimeQ[n], 1, Floor[NextPrime[n, -1]/ FactorInteger[n][[-1, 1]]]];
Array[a, 100] (* Jean-François Alcover, Mar 04 2019 *)
CROSSREFS
Sequence in context: A370060 A344893 A338946 * A231820 A010268 A181657
KEYWORD
nonn,look
AUTHOR
Reinhard Zumkeller, May 04 2003
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 April 25 01:06 EDT 2024. Contains 371964 sequences. (Running on oeis4.)