Recursive determination of the enumerator for sums of three squares
For each nonnegative integer n, r3(n) denotes the number of representations of n by sums of three squares. Here presented is a two-step recursive scheme for computing r3(n), n≥0.
Main Author: | John A. Ewell |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2000-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171200003902 |
Similar Items
-
Sums of Squares of Consecutive Integers
Published: (2010) -
The Enumeration of own $t$-Dimensional Subspaces of a Space $V_{m}$ over the Field $GF(q)$
by: G. Egorychev
Published: (2016-09-01) -
On the Number of Integers Expressible as the Sum of Two Squares
by: Richardson, Robert
Published: (2009) -
ALGEBRAIC PROPERTIES OF HERMITIAN SUMS OF SQUARES, II
by: Brooks, J., et al.
Published: (2022) -
A Short Calculation of the Multiple Sum of Krivokolesko-Leinartas with Linear Constraints on Summation Indices
by: G.P. Egorychev
Published: (2019-09-01)