The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A329586 Row lengths of A329585: number of solutions of the congruences x^2 == +1 (mod n) or (inclusive) x^2 == -1 (mod n), for n >= 1. 5
 1, 2, 2, 2, 4, 2, 2, 4, 2, 4, 2, 4, 4, 2, 4, 4, 4, 2, 2, 4, 4, 2, 2, 8, 4, 4, 2, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4, 2, 4, 8, 4, 4, 2, 4, 4, 2, 2, 8, 2, 4, 4, 4, 4, 2, 4, 8, 4, 4, 2, 8, 4, 2, 4, 4, 8, 4, 2, 4, 4, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS See A329585 for details and examples (there n is called m). For the number of all representative solutions z^2 = +1 (mod n), for n >= 1, with z = a + b*i, where a and b are nonnegative integers, see A227091. LINKS FORMULA a(1) = 1, a(2) = 2 (special case), and for n >= 3: a(n) =  2^{r2(e2) + r1 + r3} + delta_{r2(e2),0} * delta_{r3,0}*2^r1, where r1 = r1(n) and r3 = r3(n) are the number of the distinct odd primes congruent to 1 and 3 modulo 4, respectively, in the prime number factorization of n, and  r2(e2) = 0, 1 and 2 if the power e2 of the even prime 2 is 0 (odd n case) or 1, 2 and >= 3, respectively, and delta is the Kronecker symbol. a(n) is always a nonnegative power of 2. (See A329585 for a sketch of the proof.) CROSSREFS Cf. A329585, A329588, A227091. Sequence in context: A188903 A066671 A159802 * A255336 A292929 A049627 Adjacent sequences:  A329583 A329584 A329585 * A329587 A329588 A329589 KEYWORD nonn,easy AUTHOR Wolfdieter Lang,Dec 14 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 20 07:46 EDT 2020. Contains 337264 sequences. (Running on oeis4.)