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!)
A289311 Let f be the multiplicative function satisfying f(p^k) = (1 + p*I)^k for any prime p and k > 0 (where I^2 = -1); a(n) = the imaginary part of f(n). 4

%I #25 Jul 10 2017 04:11:50

%S 0,2,3,4,5,5,7,-2,6,7,11,-5,13,9,8,-24,17,-10,19,-11,10,13,23,-35,10,

%T 15,-18,-17,29,-20,31,-38,14,19,12,-50,37,21,16,-57,41,-30,43,-29,-34,

%U 25,47,-45,14,-38,20,-35,53,-70,16,-79,22,31,59,-80,61,33,-50

%N Let f be the multiplicative function satisfying f(p^k) = (1 + p*I)^k for any prime p and k > 0 (where I^2 = -1); a(n) = the imaginary part of f(n).

%C See A289310 for the real part of f and additional comments.

%C See A289320 for the square of the norm of f.

%C a(p) = p for any prime p.

%C The numbers 4 and 2700 are composite fixed points.

%C If a(n) = 0, then a(n^k) = 0 for any k > 0.

%C 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).

%C a(n) = 0 for n = 1, 378, 1296, 142884, 489888, 639846, 1679616, 1873638, ...

%C As a(378) = 0 and 378 = 2 * 3^3 * 7, we have arctan(2) + arctan(3)*3 + arctan(7) = j * Pi (with j = 2).

%H Rémy Sigrist, <a href="/A289311/b289311.txt">Table of n, a(n) for n = 1..10000</a>

%e f(12) = f(2^2 * 3) = (1 + 2*I)^2 * (1 + 3*I) = -15 - 5*I, hence a(12) = -5.

%t Array[Im[Times @@ Map[(1 + #1 I)^#2 & @@ # &, FactorInteger@ #]] - Boole[# == 1] &, 63] (* _Michael De Vlieger_, Jul 03 2017 *)

%o (PARI) a(n) = my (f=factor(n)); imag (prod(i=1, #f~, (1 + f[i,1]*I) ^ f[i,2]))

%Y Cf. A289310, A289320.

%K sign

%O 1,2

%A _Rémy Sigrist_, Jul 02 2017

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 September 9 21:41 EDT 2024. Contains 375765 sequences. (Running on oeis4.)