The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS G. C. Greubel, Table of n, a(n) for n = 1..10000 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 Adjacent sequences:  A166673 A166674 A166675 * A166677 A166678 A166679 KEYWORD nonn,mult AUTHOR Jaroslav Krizek, Oct 18 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 16 23:40 EDT 2021. Contains 343051 sequences. (Running on oeis4.)