The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #8 May 22 2016 12:57:11
%S 1,12,19,144,33,228,47,1728,361,396,75,2736,89,564,627,20736,117,4332,
%T 131,4752,893,900,159,32832,1089,1068,6859,6768,201,7524,215,248832,
%U 1425,1404,1551,51984,257,1572,1691,57024,285,10716,299,10800,11913
%N Totally multiplicative sequence with a(p) = 7p-2 for prime p.
%H G. C. Greubel, <a href="/A166671/b166671.txt">Table of n, a(n) for n = 1..10000</a>
%F Multiplicative with a(p^e) = (7p-2)^e. If n = Product p(k)^e(k) then a(n) = Product (7*p(k)-2)^e(k).
%t a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((7*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