A258115 a(n) = A208570(n)/n.

2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 5

Offset: 1

Author

Robert Israel, May 20 2015

Keywords

• nonn

Comments

The prime p that minimizes p^(1+nu_p(n)), where nu_p(n) is the p-adic order of n.

It satisfies p^(1+nu_p(n)) = A007978(n).

Links

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

Crossrefs

Cf. A007978, A208570.

Programs

Haskell

a258115 n = a208570 n `div` n  -- Reinhard Zumkeller, May 22 2015

Maple

Primes:= select(isprime,[2,seq(2*i+1,i=1..100)]):
seq(Primes[min[index](map(p -> p^(1+padic[ordp](n,p)), Primes))],n=1..200);

Mathematica

Table[(LCM[n, Min[Complement[Range[n+1], Divisors[n]]]]/n), {n, 100}] (* Vincenzo Librandi, May 21 2015 *)