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 A365636 #15 Feb 16 2024 05:27:26
%S A365636 1,4,27,4,3125,108,823543,16,27,12500,285311670611,108,
%T A365636 302875106592253,3294172,84375,16,827240261886336764177,108,
%U A365636 1978419655660313589123979,12500,22235661,1141246682444,20880467999847912034355032910567,432,3125,1211500426369012,27,3294172
%N A365636 a(n) is the smallest multiple of n that is a term of A072873.
%H A365636 Amiram Eldar, <a href="/A365636/b365636.txt">Table of n, a(n) for n = 1..388</a>
%F A365636 Multiplicative with a(p^e) = p^(p*ceiling(e/p)).
%F A365636 a(n) = n * A365637(n).
%F A365636 a(n) >= n with equality if and only if n is in A072873.
%F A365636 Sum_{n>=1} 1/a(n) = Product_{p prime} (1 + p/(p^p-1)) = 1.86196549645040699446... .
%t A365636 f[p_, e_] := p^(Ceiling[e/p]*p); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 30]
%o A365636 (PARI) a(n) = {my(f = factor(n)); prod(i = 1, #f~, f[i,1]^(f[i,1] * ceil(f[i,2] / f[i,1])));}
%Y A365636 Cf. A072873, A365637.
%K A365636 nonn,easy,mult
%O A365636 1,2
%A A365636 _Amiram Eldar_, Sep 14 2023
%E A365636 Data, formulas and codes corrected by _Amiram Eldar_, Feb 15 2024