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 A167328 #11 Oct 21 2023 05:33:31
%S A167328 1,45,54,2025,72,2430,90,91125,2916,3240,126,109350,144,4050,3888,
%T A167328 4100625,180,131220,198,145800,4860,5670,234,4920750,5184,6480,157464,
%U A167328 182250,288,174960,306,184528125,6804,8100,6480,5904900,360,8910,7776,6561000,396,218700
%N A167328 Totally multiplicative sequence with a(p) = 9*(p+3) for prime p.
%H A167328 G. C. Greubel, <a href="/A167328/b167328.txt">Table of n, a(n) for n = 1..1000</a>
%F A167328 Multiplicative with a(p^e) = (9*(p+3))^e. If n = Product p(k)^e(k) then a(n) = Product (9*(p(k)+3))^e(k).
%F A167328 a(n) = A165830(n) * A166591(n) = 9^bigomega(n) * A166591(n) = 9^A001222(n) * A166591(n).
%t A167328 a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] + 3)^fi[[All, 2]])); Table[a[n]*9^PrimeOmega[n], {n, 1, 100}] (* _G. C. Greubel_, Jun 09 2016 *)
%t A167328 f[p_, e_] := (9*(p+3))^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Oct 21 2023 *)
%Y A167328 Cf. A001222, A165830, A166591.
%K A167328 nonn,easy,mult
%O A167328 1,2
%A A167328 _Jaroslav Krizek_, Nov 01 2009