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

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A167310 Totally multiplicative sequence with a(p) = 9*(p+2) for prime p. 1
 1, 36, 45, 1296, 63, 1620, 81, 46656, 2025, 2268, 117, 58320, 135, 2916, 2835, 1679616, 171, 72900, 189, 81648, 3645, 4212, 225, 2099520, 3969, 4860, 91125, 104976, 279, 102060, 297, 60466176, 5265, 6156, 5103, 2624400, 351, 6804, 6075 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS G. C. Greubel, Table of n, a(n) for n = 1..1000 FORMULA Multiplicative with a(p^e) = (9*(p+2))^e. If n = Product p(k)^e(k) then a(n) = Product (9*(p(k)+2))^e(k). a(n) = A165830(n) * A166590(n) = 9^bigomega(n) * A166590(n) = 9^A001222(n) * A166590(n). MATHEMATICA a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] + 2)^fi[[All, 2]])); Table[a[n]*9^PrimeOmega[n], {n, 1, 100}] (* G. C. Greubel, Jun 07 2016 *) CROSSREFS Sequence in context: A068143 A264961 A188630 * A083674 A160063 A260927 Adjacent sequences:  A167307 A167308 A167309 * A167311 A167312 A167313 KEYWORD nonn,mult AUTHOR Jaroslav Krizek, Nov 01 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 November 26 16:27 EST 2020. Contains 338641 sequences. (Running on oeis4.)