The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #8 May 22 2016 12:56:52
%S 1,21,31,441,51,651,71,9261,961,1071,111,13671,131,1491,1581,194481,
%T 171,20181,191,22491,2201,2331,231,287091,2601,2751,29791,31311,291,
%U 33201,311,4084101,3441,3591,3621,423801,371,4011,4061,472311,411,46221,431
%N Totally multiplicative sequence with a(p) = 10p+1 for prime p.
%H G. C. Greubel, <a href="/A166668/b166668.txt">Table of n, a(n) for n = 1..10000</a>
%F Multiplicative with a(p^e) = (10p+1)^e. If n = Product p(k)^e(k) then a(n) = Product (10*p(k)+1)^e(k).
%t a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((10*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