This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A225558 a(n) = A003418(n)/A000793(n). 6
 1, 1, 1, 2, 3, 10, 10, 35, 56, 126, 84, 924, 462, 6006, 4290, 3432, 5148, 58344, 58344, 554268, 554268, 554268, 554268, 6374082, 6374082, 21246940, 21246940, 52151580, 34767720, 924241890, 504131940, 15628090140, 26447537160, 26447537160, 15628090140 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..1000 FORMULA a(n) = A003418(n)/A000793(n). A074115(n)/a(n) = A025527(n). MAPLE g:= proc(n) g(n):= `if`(n=0, 1, ilcm(n, g(n-1))) end: b:= proc(n, i) option remember; local p;       p:= `if`(i<1, 1, ithprime(i));       `if`(n=0 or i<1, 1, max(b(n, i-1),            seq(p^j*b(n-p^j, i-1), j=1..ilog[p](n))))     end: a:= n->g(n)/b(n, `if`(n<8, 3,     numtheory[pi](ceil(1.328*isqrt(n*ilog(n)))))): seq(a(n), n=0..40); # Alois P. Heinz, May 22 2013 MATHEMATICA 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 *) CROSSREFS Cf. A000793, A003418. Sequence in context: A303115 A074068 A283436 * A301382 A288657 A055655 Adjacent sequences:  A225555 A225556 A225557 * A225559 A225560 A225561 KEYWORD nonn AUTHOR Antti Karttunen, May 10 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 19 11:12 EDT 2019. Contains 323390 sequences. (Running on oeis4.)