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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A167354 Totally multiplicative sequence with a(p) = (p-2)^2 = p^2-4p+4 for prime p. 1
 1, 0, 1, 0, 9, 0, 25, 0, 1, 0, 81, 0, 121, 0, 9, 0, 225, 0, 289, 0, 25, 0, 441, 0, 81, 0, 1, 0, 729, 0, 841, 0, 81, 0, 225, 0, 1225, 0, 121, 0, 1521, 0, 1681, 0, 9, 0, 2025, 0, 625, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS G. C. Greubel, Table of n, a(n) for n = 1..1000 FORMULA Multiplicative with a(p^e) = ((p-2)^2)^e. If n = Product p(k)^e(k) then a(n) = Product ((p(k)-2)^2)^e(k). a(2k) = 0 for k >= 1, a(n) = A166586(n)^2. MATHEMATICA a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] - 2)^fi[[All, 2]])); Table[a[n]^2, {n, 1, 100}] (* G. C. Greubel, Jun 11 2016 *) CROSSREFS Cf. A166586. Sequence in context: A007394 A067153 A057405 * A005066 A076262 A167301 Adjacent sequences: A167351 A167352 A167353 * A167355 A167356 A167357 KEYWORD nonn,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.

Last modified December 2 05:20 EST 2022. Contains 358485 sequences. (Running on oeis4.)