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!)
A332425 If n = Product (p_j^k_j) then a(n) = Sum ((-1)^(pi(p_j) + 1) * p_j * k_j), where pi = A000720. 1
0, 2, -3, 4, 5, -1, -7, 6, -6, 7, 11, 1, -13, -5, 2, 8, 17, -4, -19, 9, -10, 13, 23, 3, 10, -11, -9, -3, -29, 4, 31, 10, 8, 19, -2, -2, -37, -17, -16, 11, 41, -8, -43, 15, -1, 25, 47, 5, -14, 12, 14, -9, -53, -7, 16, -1, -22, -27, 59, 6, -61, 33, -13, 12, -8, 10, 67, 21, 20 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Sum of prime factors of n (counted with multiplicity) with odd indices minus the sum of prime factors of n (counted with multiplicity) with even indices.
LINKS
EXAMPLE
a(252) = a(2^2 * 3^2 * 7) = a(prime(1)^2 * prime(2)^2 * prime(4)) = 2 + 2 - 3 - 3 - 7 = -9.
MATHEMATICA
a[n_] := Plus @@ ((-1)^(PrimePi[#[[1]]] + 1) #[[1]] #[[2]] & /@ FactorInteger[n]); a[1] = 0; Table[a[n], {n, 1, 69}]
CROSSREFS
Sequence in context: A082299 A081806 A059806 * A286594 A241479 A100994
KEYWORD
sign
AUTHOR
Ilya Gutkovskiy, Feb 12 2020
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 May 10 11:28 EDT 2024. Contains 372387 sequences. (Running on oeis4.)