A083716 a(n) = integer part of (greatest prime <= n)/(greatest prime factor of n); a(1) = 1.

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

Offset: 1

Author

Reinhard Zumkeller, May 04 2003

Keywords

• nonn
• look

Comments

a(n) = floor(A007917(n)/A006530(n));

a(p) = 1 for primes p.

Links

• Robert Israel, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A006530, A007917.

Cf. A083715, A083717, A083714, A083718.

Programs

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 *)