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!)
 A103225 Number of Gaussian integers z with abs(z) < n and gcd(n,z)=1. 1
 1, 4, 24, 24, 44, 48, 144, 96, 224, 96, 372, 192, 444, 304, 404, 392, 792, 448, 1124, 408, 1200, 752, 1648, 808, 1240, 896, 2036, 1200, 2440, 800, 2996, 1600, 3008, 1592, 2404, 1808, 4056, 2256, 3616, 1600, 4992, 2400, 5784, 3008, 3604, 3304, 6916, 3224, 7376 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS This sequence is much like the usual totient function. That is, it gives the number of Gaussian integers that are relatively prime to n and whose modulus is less than n. When n is a Gaussian prime, A002145, then a(n) = A051132(n)-1. LINKS Amiram Eldar, Table of n, a(n) for n = 1..1000 (terms 1..200 from T. D. Noe) EXAMPLE a(2)=4 because 1, -1, i and -i are relatively prime to 2 and have modulus less than 2. MATHEMATICA Table[cnt=0; Do[z=a+ b*I; If[Abs[z]

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 1 16:09 EST 2022. Contains 358468 sequences. (Running on oeis4.)