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 A167329 #11 Oct 21 2023 05:33:27
%S A167329 1,50,60,2500,80,3000,100,125000,3600,4000,140,150000,160,5000,4800,
%T A167329 6250000,200,180000,220,200000,6000,7000,260,7500000,6400,8000,216000,
%U A167329 250000,320,240000,340,312500000,8400,10000,8000,9000000,400,11000,9600,10000000,440,300000
%N A167329 Totally multiplicative sequence with a(p) = 10*(p+3) for prime p.
%H A167329 G. C. Greubel, <a href="/A167329/b167329.txt">Table of n, a(n) for n = 1..1000</a>
%F A167329 Multiplicative with a(p^e) = (10*(p+3))^e. If n = Product p(k)^e(k) then a(n) = Product (10*(p(k)+3))^e(k).
%F A167329 a(n) = A165831(n) * A166591(n) = 10^bigomega(n) * A166591(n) = 10^A001222(n) * A166591(n).
%t A167329 a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] + 3)^fi[[All, 2]])); Table[a[n]*10^PrimeOmega[n], {n, 1, 100}] (* _G. C. Greubel_, Jun 09 2016 *)
%t A167329 f[p_, e_] := (10*(p+3))^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Oct 21 2023 *)
%Y A167329 Cf. A001222, A165831, A166591.
%K A167329 nonn,easy,mult
%O A167329 1,2
%A A167329 _Jaroslav Krizek_, Nov 01 2009