login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A167313 Totally multiplicative sequence with a(p) = 3*(p-3) for prime p. 1
1, -3, 0, 9, 6, 0, 12, -27, 0, -18, 24, 0, 30, -36, 0, 81, 42, 0, 48, 54, 0, -72, 60, 0, 36, -90, 0, 108, 78, 0, 84, -243, 0, -126, 72, 0, 102, -144, 0, -162, 114, 0, 120, 216, 0, -180, 132, 0, 144, -108, 0, 270, 150, 0, 144, -324, 0, -234, 168, 0, 174, -252, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
Multiplicative with a(p^e) = (3*(p-3))^e. If n = Product p(k)^e(k) then a(n) = Product (3*(p(k)-3))^e(k).
a(3k) = 0 for k >= 1.
a(n) = A165824(n) * A166589(n) = 3^bigomega(n) * A166589(n) = 3^A001222(n) * A166589(n).
MATHEMATICA
a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] - 3)^fi[[All, 2]])); Table[a[n]*3^PrimeOmega[n], {n, 1, 100}] (* G. C. Greubel, Jun 08 2016 *)
f[p_, e_] := (3*(p-3))^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Oct 21 2023 *)
CROSSREFS
Sequence in context: A002346 A021327 A297053 * A104780 A176109 A342361
KEYWORD
sign,easy,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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 08:33 EDT 2024. Contains 371905 sequences. (Running on oeis4.)