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 A124510 #13 Jul 11 2023 03:41:47
%S A124510 1,2,4,8,6,16,12,32,24,64,30,48,128,60,96,256,120,192,210,512,240,384,
%T A124510 420,1024,480,768,840,2048,960,2310,1536,1680,4096,1920,4620,3072,
%U A124510 3360,8192,3840,9240,6144,6720,30030,16384,7680,18480,12288,13440,60060,32768,15360,36960,24576
%N A124510 Smallest m such that A124508(m) = A124509(n).
%H A124510 Amiram Eldar, <a href="/A124510/b124510.txt">Table of n, a(n) for n = 1..10000</a>
%F A124510 A124509(n) = A124508(a(n)).
%F A124510 A124508(k) <> A124508(a(n)) for k < a(n).
%F A124510 a(n) = A002110(e_3) * 2^(e_2-e_3), where e_2 = valuation(A124509(n), 2), and e_3 = valuation(A124509(n), 3).
%t A124510 f[n_] := Module[{e2 = IntegerExponent[n, 2], e3 = IntegerExponent[n, 3]}, Product[Prime[i], {i, 1, e3}] * 2^(e2 - e3)];
%t A124510 With[{max = 10^5}, f /@ Join[{1}, Sort[Flatten[Table[2^i*3^j, {i, 1, Log2[max]}, {j, 1, Min[i, Log[3, max/2^i]]}]]]]] (* _Amiram Eldar_, Jul 11 2023 *)
%Y A124510 Cf. A002110, A124508, A124509.
%K A124510 nonn,easy
%O A124510 1,2
%A A124510 _Reinhard Zumkeller_, Nov 04 2006
%E A124510 Name corrected and missing terms inserted by _Amiram Eldar_, Jul 11 2023