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 A167306 #12 Oct 19 2023 02:15:53
%S A167306 1,20,25,400,35,500,45,8000,625,700,65,10000,75,900,875,160000,95,
%T A167306 12500,105,14000,1125,1300,125,200000,1225,1500,15625,18000,155,17500,
%U A167306 165,3200000,1625,1900,1575,250000,195,2100,1875,280000,215,22500,225,26000
%N A167306 Totally multiplicative sequence with a(p) = 5*(p+2) for prime p.
%H A167306 G. C. Greubel, <a href="/A167306/b167306.txt">Table of n, a(n) for n = 1..1000</a>
%F A167306 Multiplicative with a(p^e) = (5*(p+2))^e. If n = Product p(k)^e(k) then a(n) = Product (5*(p(k)+2))^e(k).
%F A167306 a(n) = A165826(n) * A166590(n) = 5^bigomega(n) * A166590(n) = 5^A001222(n) * A166590(n).
%t A167306 a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] + 2)^fi[[All, 2]])); Table[a[n]*5^PrimeOmega[n], {n, 1, 100}] (* _G. C. Greubel_, Jun 07 2016 *)
%t A167306 f[p_, e_] := (5*(p+2))^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Oct 19 2023 *)
%Y A167306 Cf. A001222, A165826, A166590.
%K A167306 nonn,easy,mult
%O A167306 1,2
%A A167306 _Jaroslav Krizek_, Nov 01 2009