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 A166631 #11 Oct 30 2019 12:05:53
%S A166631 1,20,30,400,50,600,70,8000,900,1000,110,12000,130,1400,1500,160000,
%T A166631 170,18000,190,20000,2100,2200,230,240000,2500,2600,27000,28000,290,
%U A166631 30000,310,3200000,3300,3400,3500,360000,370,3800,3900,400000,410,42000,430
%N A166631 Totally multiplicative sequence with a(p) = 10p for prime p.
%H A166631 G. C. Greubel, <a href="/A166631/b166631.txt">Table of n, a(n) for n = 1..10000</a>
%F A166631 Multiplicative with a(p^e) = (10p)^e.
%F A166631 If n = Product p(k)^e(k) then a(n) = Product (10*p(k))^e(k).
%F A166631 a(n) = n * A165831(n) = n * 10^bigomega(n) = n * 10^A001222(n).
%F A166631 Dirichlet g.f.: Product_{p prime} 1 / (1 - 10 * p^(1 - s)). - _Ilya Gutkovskiy_, Oct 30 2019
%t A166631 Table[n*10^PrimeOmega[n], {n, 1, 100}] (* _G. C. Greubel_, May 19 2016 *)
%Y A166631 Cf. A001222, A165831.
%K A166631 nonn,mult
%O A166631 1,2
%A A166631 _Jaroslav Krizek_, Oct 18 2009