The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #8 May 22 2016 12:56:47
%S 1,19,28,361,46,532,64,6859,784,874,100,10108,118,1216,1288,130321,
%T 154,14896,172,16606,1792,1900,208,192052,2116,2242,21952,23104,262,
%U 24472,280,2476099,2800,2926,2944,283024,334,3268,3304,315514,370,34048,388
%N Totally multiplicative sequence with a(p) = 9p+1 for prime p.
%H G. C. Greubel, <a href="/A166667/b166667.txt">Table of n, a(n) for n = 1..10000</a>
%F Multiplicative with a(p^e) = (9p+1)^e. If n = Product p(k)^e(k) then a(n) = Product (9*p(k)+1)^e(k).
%t a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((9*fi[[All, 1]] + 1)^fi[[All, 2]])); Table[a[n], {n, 1, 100}] (* _G. C. Greubel_, May 22 2016 *)
%K nonn,mult
%O 1,2
%A _Jaroslav Krizek_, Oct 18 2009