%I #12 Aug 31 2016 20:54:44

%S 1,1,2,1,2,1,6,3,6,3,6,1,6,3,6,3,6,1,6,3,6,3,6,1,6,3,6,3,6,1,30,15,30,

%T 15,30,5,30,15,30,15,30,5,30,15,30,15,30,5,30,15,30,15,30,5,30,15,30,

%U 15,30,1,30,15,30,15,30,5,30,15,30,15,30,5,30,15,30,15,30,5,30,15,30

%N a(n) = {greatest primorial less than or equal to n} divided by {greatest primorial number which divides n} = A260188(n)/A053589(n).

%H Antti Karttunen, <a href="/A276157/b276157.txt">Table of n, a(n) for n = 1..11550</a>

%H <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>

%F a(n) = A260188(n)/A053589(n).

%t Table[(j = #; While[! Divisible[n, Times @@ Prime@ Range@ j], j--]; (Times @@ Prime@ Range@ #)/(Times @@ Prime@ Range@ j)) &@ (k = 0; While[Times @@ Prime@ Range[k + 1] <= n, k++]; k), {n, 120}] (* _Michael De Vlieger_, Aug 30 2016 *)

%o (Scheme) (define (A276157 n) (/ (A260188 n) (A053589 n)))

%Y Cf. A002110, A053589, A260188.

%Y Cf. A060735 (positions of ones).

%K nonn

%O 1,3

%A _Antti Karttunen_, Aug 30 2016