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”).

A166676
Totally multiplicative sequence with a(p) = 9p+2 for prime p.
1
1, 20, 29, 400, 47, 580, 65, 8000, 841, 940, 101, 11600, 119, 1300, 1363, 160000, 155, 16820, 173, 18800, 1885, 2020, 209, 232000, 2209, 2380, 24389, 26000, 263, 27260, 281, 3200000, 2929, 3100, 3055, 336400, 335, 3460, 3451, 376000, 371, 37700, 389
OFFSET
1,2
LINKS
FORMULA
Multiplicative with a(p^e) = (9p+2)^e. If n = Product p(k)^e(k) then a(n) = Product (9*p(k)+2)^e(k).
MATHEMATICA
a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((9*fi[[All, 1]] + 2)^fi[[All, 2]])); Table[a[n], {n, 1, 100}] (* G. C. Greubel, May 22 2016 *)
CROSSREFS
Sequence in context: A043889 A303080 A113621 * A125561 A171908 A338158
KEYWORD
nonn,mult
AUTHOR
Jaroslav Krizek, Oct 18 2009
STATUS
approved