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!)
A167343 Totally multiplicative sequence with a(p) = (p-1)^2 = p^2-2p+1 for prime p. 1
1, 1, 4, 1, 16, 4, 36, 1, 16, 16, 100, 4, 144, 36, 64, 1, 256, 16, 324, 16, 144, 100, 484, 4, 256, 144, 64, 36, 784, 64, 900, 1, 400, 256, 576, 16, 1296, 324, 576, 16, 1600, 144, 1764, 100, 256, 484, 2116, 4, 1296, 256 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
Multiplicative with a(p^e) = ((p-1)^2)^e. If n = Product p(k)^e(k) then a(n) = Product ((p(k)-1)^2)^e(k).
a(n) = A003958(n)^2.
Sum_{k=1..n} a(k) ~ c * n^3, where c = (2/Pi^2) / Product_{p prime} (1 + 1/p^2 + 1/p^3 - 1/p^4) = 0.1229567616... . - Amiram Eldar, Dec 15 2022
MATHEMATICA
a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] - 1)^fi[[All, 2]])); Table[a[n]^2, {n, 1, 100}] (* G. C. Greubel, Jun 10 2016 *)
CROSSREFS
Cf. A003958.
Sequence in context: A309074 A175844 A351434 * A094361 A187926 A285281
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)