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 A365637 #16 Apr 27 2025 00:46:00
%S A365637 1,2,9,1,625,18,117649,2,3,1250,25937424601,9,23298085122481,235298,
%T A365637 5625,1,48661191875666868481,6,104127350297911241532841,625,1058841,
%U A365637 51874849202,907846434775996175406740561329,18,125,46596170244962,1,117649,88540901833145211536614766025207452637361
%N A365637 a(n) is the smallest number k such that k*n is a term of A072873.
%H A365637 Amiram Eldar, <a href="/A365637/b365637.txt">Table of n, a(n) for n = 1..388</a>
%F A365637 Multiplicative with a(p^e) = p^(p*ceiling(e/p) - e).
%F A365637 a(n) = A365636(n)/n.
%F A365637 a(n) >= 1 with equality if and only if n is in A072873.
%t A365637 f[p_, e_] := p^(Ceiling[e/p]*p - e); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 30]
%o A365637 (PARI) a(n) = {my(f = factor(n)); prod(i = 1, #f~, f[i,1]^(f[i,1] * ceil(f[i,2] / f[i,1]) - f[i,2]));}
%Y A365637 Cf. A072873, A365636.
%K A365637 nonn,easy,mult
%O A365637 1,2
%A A365637 _Amiram Eldar_, Sep 14 2023
%E A365637 Data, formulas and codes corrected by _Amiram Eldar_, Feb 15 2024