Recursive determination of the enumerator for sums of three squares

John A. Ewell

International Journal of Mathematics and Mathematical Sciences, 2000, vol. 24, 1-4

Abstract:

For each nonnegative integer n , r 3 ( n ) denotes the number of representations of n by sums of three squares. Here presented is a two-step recursive scheme for computing r 3 ( n ) , n ≥ 0 .

Date: 2000
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/24/584813.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/24/584813.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:584813

DOI: 10.1155/S0161171200003902

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().