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!)
A167319 Totally multiplicative sequence with a(p) = 9*(p-3) for prime p. 1
1, -9, 0, 81, 18, 0, 36, -729, 0, -162, 72, 0, 90, -324, 0, 6561, 126, 0, 144, 1458, 0, -648, 180, 0, 324, -810, 0, 2916, 234, 0, 252, -59049, 0, -1134, 648, 0, 306, -1296, 0, -13122, 342, 0, 360, 5832, 0, -1620, 396, 0, 1296, -2916, 0, 7290, 450, 0, 1296, -26244 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
Multiplicative with a(p^e) = (9*(p-3))^e. If n = Product p(k)^e(k) then a(n) = Product (9*(p(k)-3))^e(k).
a(3k) = 0 for k >= 1.
a(n) = A165830(n) * A166589(n) = 9^bigomega(n) * A166589(n) = 9^A001222(n) * A166589(n).
MATHEMATICA
a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] - 3)^fi[[All, 2]])); Table[a[n]*9^PrimeOmega[n], {n, 1, 100}] (* G. C. Greubel, Jun 09 2016 *)
f[p_, e_] := (9*(p-3))^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Oct 22 2023 *)
CROSSREFS
Sequence in context: A087094 A343575 A270010 * A231948 A222396 A222516
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 24 03:08 EDT 2024. Contains 371918 sequences. (Running on oeis4.)