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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A167362 Totally multiplicative sequence with a(p) = (p-3)*(p+3) = p^2-9 for prime p. 1
1, -5, 0, 25, 16, 0, 40, -125, 0, -80, 112, 0, 160, -200, 0, 625, 280, 0, 352, 400, 0, -560, 520, 0, 256, -800, 0, 1000, 832, 0, 952, -3125, 0, -1400, 640, 0, 1360, -1760, 0, -2000, 1672, 0, 1840, 2800, 0, -2600, 2200, 0, 1600, -1280, 0, 4000, 2800, 0, 1792 (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) = ((p-3)*(p+3))^e. If n = Product p(k)^e(k) then a(n) = Product ((p(k)-3)*(p(k)+3))^e(k). a(n) = A166589(n) * A166591(n).

MATHEMATICA

a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] - 3)^fi[[All, 2]])); b[1] = 1; b[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] + 3)^fi[[All, 2]])); Table[a[n]*b[n], {n, 1, 100}] (* G. C. Greubel, Jun 11 2016 *)

CROSSREFS

Cf. A166589, A166591.

Sequence in context: A114205 A316464 A167315 * A070611 A047769 A279501

Adjacent sequences:  A167359 A167360 A167361 * A167363 A167364 A167365

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 6 10:01 EDT 2020. Contains 336245 sequences. (Running on oeis4.)