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: | |
|---|---|
| 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 |