Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 May 22 2015 04:36:08
%S 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 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 2,3,2,5,2,3,2,3,2,2,2,3,2,3,2,5
%N a(n) = A208570(n)/n.
%C The prime p that minimizes p^(1+nu_p(n)), where nu_p(n) is the p-adic order of n.
%C It satisfies p^(1+nu_p(n)) = A007978(n).
%H Robert Israel, <a href="/A258115/b258115.txt">Table of n, a(n) for n = 1..10000</a>
%p Primes:= select(isprime,[2,seq(2*i+1,i=1..100)]):
%p seq(Primes[min[index](map(p -> p^(1+padic[ordp](n,p)), Primes))],n=1..200);
%t Table[(LCM[n, Min[Complement[Range[n+1], Divisors[n]]]]/n), {n, 100}] (* _Vincenzo Librandi_, May 21 2015 *)
%o (Haskell)
%o a258115 n = a208570 n `div` n -- _Reinhard Zumkeller_, May 22 2015
%Y Cf. A007978, A208570.
%K nonn
%O 1,1
%A _Robert Israel_, May 20 2015