This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A276157 #12 Aug 31 2016 20:54:44
%S A276157 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 A276157 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 A276157 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 A276157 a(n) = {greatest primorial less than or equal to n} divided by {greatest primorial number which divides n} = A260188(n)/A053589(n).
%H A276157 Antti Karttunen, <a href="/A276157/b276157.txt">Table of n, a(n) for n = 1..11550</a>
%H A276157 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>
%F A276157 a(n) = A260188(n)/A053589(n).
%t A276157 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 A276157 (Scheme) (define (A276157 n) (/ (A260188 n) (A053589 n)))
%Y A276157 Cf. A002110, A053589, A260188.
%Y A276157 Cf. A060735 (positions of ones).
%K A276157 nonn
%O A276157 1,3
%A A276157 _Antti Karttunen_, Aug 30 2016