Sum of Squares Function -- from Wolfram MathWorld

The number of representations of n by k squares, allowing zeros and distinguishing signs and order, is denoted r_k(n). The special case k=2 corresponding to two squares is often denoted simply r_2(n)=r(n) (e.g., Hardy and Wright 1979, p. 241; Shanks 1993, p. 162). For example, consider the number of ways of representing 5 as the sum of two squares: 5 = (-2)^2+(-1)^2 (1) = (-2)^2+1^2 (2) = 2^2+(-1)^2 (3) = 2^2+1^2 (4) = (-1)^2+(-2)^2 (5) = (-1)^2+2^2 (6) = 1^2+(-2)^2 (7) =

Sum of Squares Function -- from Wolfram MathWorld

Jacobi Theta Functions -- from Wolfram MathWorld

Wolfram Alpha's capabilities blow my mind : r/math

Making Formulas… for Everything—From Pi to the Pink Panther to Sir Isaac Newton—Wolfram

A New Way to Ask Wolfram, Alpha Questions with Math Input, by Tech-Based Teaching Editor, Tech-Based Teaching: Computational Thinking in the Classroom

Sum of Squares Function -- from Wolfram MathWorld

Numerical integration - Wikipedia

Sum of Squares Function -- from Wolfram MathWorld

bit-wise xor Alchemic symbols, Wise, Math

Sum of Squares Function -- from Wolfram MathWorld

Sum of Squares Function -- from Wolfram MathWorld

Sum of Squares Function -- from Wolfram MathWorld

Hi! Idk how to prove for conditional/absolute convergence because I don't know how to solve for the series of 1/(nln(n)) from 1 to infinity (Wolfram alpha says the sum doesn't exist) Thank

WolframAlpha Full Results API Reference