This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 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 (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) = (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 *) CROSSREFS Sequence in context: A298099 A137528 A270006 * A186979 A067817 A079137 Adjacent sequences:  A167315 A167316 A167317 * A167319 A167320 A167321 KEYWORD sign,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 December 17 14:50 EST 2018. Contains 318201 sequences. (Running on oeis4.)