%I #16 Feb 27 2016 15:11:37
%S 1,1,1,2,3,10,10,35,56,126,84,924,462,6006,4290,3432,5148,58344,58344,
%T 554268,554268,554268,554268,6374082,6374082,21246940,21246940,
%U 52151580,34767720,924241890,504131940,15628090140,26447537160,26447537160,15628090140
%N a(n) = A003418(n)/A000793(n).
%H Alois P. Heinz, <a href="/A225558/b225558.txt">Table of n, a(n) for n = 0..1000</a>
%F a(n) = A003418(n)/A000793(n).
%F A074115(n)/a(n) = A025527(n).
%p g:= proc(n) g(n):= `if`(n=0, 1, ilcm(n, g(n-1))) end:
%p b:= proc(n, i) option remember; local p;
%p p:= `if`(i<1, 1, ithprime(i));
%p `if`(n=0 or i<1, 1, max(b(n, i-1),
%p seq(p^j*b(n-p^j, i-1), j=1..ilog[p](n))))
%p end:
%p a:= n->g(n)/b(n, `if`(n<8, 3,
%p numtheory[pi](ceil(1.328*isqrt(n*ilog(n)))))):
%p seq(a(n), n=0..40); # _Alois P. Heinz_, May 22 2013
%t b[n_, i_] := b[n, i] = Module[{p}, p = If[i<1, 1, Prime[i]]; If[n==0 || i<1, 1, Max[b[n, i-1], Table[p^j*b[n-p^j, i-1], {j, 1, Log[p, n] // Floor }]]]]; a[0]=1; a[n_] := LCM @@ Range[n] / b[n, If[n<8, 3, PrimePi[ Ceiling[ 1.328*Sqrt[n*Log[n] // Floor]]]]]; Table[a[n], {n, 0, 40}] (* _Jean-François Alcover_, Feb 27 2016, after _Alois P. Heinz_ *)
%Y Cf. A000793, A003418.
%K nonn
%O 0,4
%A _Antti Karttunen_, May 10 2013