The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #8 May 22 2016 12:57:22
%S 1,8,11,64,17,88,23,512,121,136,35,704,41,184,187,4096,53,968,59,1088,
%T 253,280,71,5632,289,328,1331,1472,89,1496,95,32768,385,424,391,7744,
%U 113,472,451,8704,125,2024,131,2240,2057,568,143,45056,529,2312
%N Totally multiplicative sequence with a(p) = 3p+2 for prime p.
%H G. C. Greubel, <a href="/A166673/b166673.txt">Table of n, a(n) for n = 1..10000</a>
%F Multiplicative with a(p^e) = (3p+2)^e. If n = Product p(k)^e(k) then a(n) = Product (3*p(k)+2)^e(k).
%t a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((3*fi[[All, 1]] + 2)^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