OFFSET
1,2
COMMENTS
See A289310 for the real part of f and additional comments.
See A289320 for the square of the norm of f.
a(p) = p for any prime p.
The numbers 4 and 2700 are composite fixed points.
If a(n) = 0, then a(n^k) = 0 for any k > 0.
a(n) = 0 iff Sum_{i=1...k} ( arctan(p_i) * e_i } = Pi * j for some integer j (where Product_{i=1..k} p_i^e_i is the prime factorization of n).
a(n) = 0 for n = 1, 378, 1296, 142884, 489888, 639846, 1679616, 1873638, ...
As a(378) = 0 and 378 = 2 * 3^3 * 7, we have arctan(2) + arctan(3)*3 + arctan(7) = j * Pi (with j = 2).
LINKS
Rémy Sigrist, Table of n, a(n) for n = 1..10000
EXAMPLE
f(12) = f(2^2 * 3) = (1 + 2*I)^2 * (1 + 3*I) = -15 - 5*I, hence a(12) = -5.
MATHEMATICA
Array[Im[Times @@ Map[(1 + #1 I)^#2 & @@ # &, FactorInteger@ #]] - Boole[# == 1] &, 63] (* Michael De Vlieger, Jul 03 2017 *)
PROG
(PARI) a(n) = my (f=factor(n)); imag (prod(i=1, #f~, (1 + f[i, 1]*I) ^ f[i, 2]))
CROSSREFS
KEYWORD
sign
AUTHOR
Rémy Sigrist, Jul 02 2017
STATUS
approved