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!)
A167318 Totally multiplicative sequence with a(p) = 8*(p-3) for prime p. 1
1, -8, 0, 64, 16, 0, 32, -512, 0, -128, 64, 0, 80, -256, 0, 4096, 112, 0, 128, 1024, 0, -512, 160, 0, 256, -640, 0, 2048, 208, 0, 224, -32768, 0, -896, 512, 0, 272, -1024, 0, -8192, 304, 0, 320, 4096, 0, -1280, 352, 0, 1024, -2048, 0, 5120, 400, 0, 1024, -16384 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
Multiplicative with a(p^e) = (8*(p-3))^e. If n = Product p(k)^e(k) then a(n) = Product (8*(p(k)-3))^e(k).
a(3k) = 0 for k >= 1.
a(n) = A165829(n) * A166589(n) = 8^bigomega(n) * A166589(n) = 8^A001222(n) * A166589(n).
MATHEMATICA
a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] - 3)^fi[[All, 2]])); Table[a[n]*8^PrimeOmega[n], {n, 1, 100}] (* G. C. Greubel, Jun 09 2016 *)
f[p_, e_] := (8*(p-3))^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Oct 22 2023 *)
CROSSREFS
Sequence in context: A298099 A137528 A270006 * A186979 A067817 A350452
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 September 2 08:40 EDT 2024. Contains 375613 sequences. (Running on oeis4.)