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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A167310 Totally multiplicative sequence with a(p) = 9*(p+2) for prime p. 1

%I

%S 1,36,45,1296,63,1620,81,46656,2025,2268,117,58320,135,2916,2835,

%T 1679616,171,72900,189,81648,3645,4212,225,2099520,3969,4860,91125,

%U 104976,279,102060,297,60466176,5265,6156,5103,2624400,351,6804,6075

%N Totally multiplicative sequence with a(p) = 9*(p+2) for prime p.

%H G. C. Greubel, <a href="/A167310/b167310.txt">Table of n, a(n) for n = 1..1000</a>

%F 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).

%t 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 *)

%K nonn,mult

%O 1,2

%A _Jaroslav Krizek_, Nov 01 2009

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 16 06:41 EST 2021. Contains 340204 sequences. (Running on oeis4.)