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 A307107 #75 Apr 06 2019 01:18:01
%S A307107 1,1,2,1,4,2,8,4,1,16,6,8,2,32,12,16,4,64,24,6,32,1,36,8,128,48,12,64,
%T A307107 2,72,16,256,96,24,128,4,144,30,32,512,36,192,6,216,48,256,8,288,60,
%U A307107 64,1024,72,384,1,12,432,96,512,16,576,120,128,2048,144,768,2
%N A307107 a(n) = A025487(n)/A247451(n).
%C A307107 Ratio of A025487(n) and the largest primorial that divides A025487(n). The largest primorial that divides A025487(n) is A002110(A001221(n)).
%C A307107 If A025487(n) is a primorial (i.e., in A002110), a(n) = 1.
%C A307107 a(n) is in A025487 by definition of that sequence as a sorted list of products of primorials.
%C A307107 Conjectures:
%C A307107 1. 1 is the most common value in this sequence even though it only pertains to primorials.
%C A307107 2. All terms in A025487 are in this sequence.
%H A307107 David A. Corneth, <a href="/A307107/b307107.txt">Table of n, a(n) for n = 1..10000</a>
%F A307107 a(n) = A025487(n)/A002110(A061394(n)) = A025487(n)/A002110(A001221(A025487(n))).
%e A307107 We can represent the prime divisors p with multiplicity of A025487(n) in a chart where the columns pertain to p and the rows multiplicity. In such a chart, A247451(n) is the longest row (marked by "O" below), and a(n) is the product of primes left over (marked by "X") when we eliminate the primes that produce A247451(n).
%e A307107 A025487(9) = 30 = a(9) * A247451(9)
%e A307107 = 1 * 30
%e A307107 1 O O O
%e A307107 2 3 5
%e A307107 A025487(27) = 360 = a(27) * A247451(27)
%e A307107 = 12 * 30
%e A307107 3 X
%e A307107 2 X X
%e A307107 1 O O O
%e A307107 2 3 5
%e A307107 A025487(183) = 166320 = a(183) * A247451(183)
%e A307107 = 72 * 2310
%e A307107 4 X
%e A307107 3 X X
%e A307107 2 X X
%e A307107 1 O O O O O
%e A307107 2 3 5 7 11
%t A307107 f[n_] := {{1}}~Join~Block[{lim = Product[Prime@ i, {i, n}], ww = NestList[Append[#, 1] &, {1}, n - 1], g}, g[x_] := Apply[Times, MapIndexed[Prime[First@ #2]^#1 &, x]]; Map[Block[{w = #, k = 1}, Sort@ Prepend[If[Length@ # == 0, #, #[[1]]], Product[Prime@ i, {i, Length@ w}]] &@ Reap[Do[If[# < lim, Sow[#]; k = 1, If[k >= Length@ w, Break[], k++]] &@ g@ Set[w, If[k == 1, MapAt[# + 1 &, w, k], PadLeft[#, Length@ w, First@#] &@ Drop[MapAt[# + Boole[i > 1] &, w, k], k - 1]]], {i, Infinity}]][[-1]]] &, ww]]; With[{s = Union@ Flatten@ f@ 6}, Map[#/Product[Prime@ i, {i, PrimeNu@ #}] &, s]]
%Y A307107 Cf. A001221, A002110, A025487, A061394, A247451.
%K A307107 nonn,look
%O A307107 1,3
%A A307107 _Michael De Vlieger_, Mar 29 2019