login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A166668
Totally multiplicative sequence with a(p) = 10p+1 for prime p.
1
1, 21, 31, 441, 51, 651, 71, 9261, 961, 1071, 111, 13671, 131, 1491, 1581, 194481, 171, 20181, 191, 22491, 2201, 2331, 231, 287091, 2601, 2751, 29791, 31311, 291, 33201, 311, 4084101, 3441, 3591, 3621, 423801, 371, 4011, 4061, 472311, 411, 46221, 431
OFFSET
1,2
LINKS
FORMULA
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).
MATHEMATICA
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 *)
CROSSREFS
Sequence in context: A243360 A068657 A068671 * A019423 A002639 A054282
KEYWORD
nonn,mult
AUTHOR
Jaroslav Krizek, Oct 18 2009
STATUS
approved