cp's OEIS Frontend

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

%I A258115 #15 May 22 2015 04:36:08
%S A258115 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,
%T A258115 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,
%U A258115 2,3,2,5,2,3,2,3,2,2,2,3,2,3,2,5
%N A258115 a(n) = A208570(n)/n.
%C A258115 The prime p that minimizes p^(1+nu_p(n)), where nu_p(n) is the p-adic order of n.
%C A258115 It satisfies p^(1+nu_p(n)) = A007978(n).
%H A258115 Robert Israel, <a href="/A258115/b258115.txt">Table of n, a(n) for n = 1..10000</a>
%p A258115 Primes:= select(isprime,[2,seq(2*i+1,i=1..100)]):
%p A258115 seq(Primes[min[index](map(p -> p^(1+padic[ordp](n,p)), Primes))],n=1..200);
%t A258115 Table[(LCM[n, Min[Complement[Range[n+1], Divisors[n]]]]/n), {n, 100}] (* _Vincenzo Librandi_, May 21 2015 *)
%o A258115 (Haskell)
%o A258115 a258115 n = a208570 n `div` n  -- _Reinhard Zumkeller_, May 22 2015
%Y A258115 Cf. A007978, A208570.
%K A258115 nonn
%O A258115 1,1
%A A258115 _Robert Israel_, May 20 2015