Hostname: page-component-7b7567c8c-48dgx Total loading time: 0 Render date: 2026-11-18T04:32:34.183Z Has data issue: false hasContentIssue false

Some computations for m-dimensional partitions

Published online by Cambridge University Press:  24 October 2008

A. O. L. Atkin
Affiliation:
The Atlas Computer Laboratory, Chilton, Didcot; University of Edinburgh; Magdalen College, Oxford; University of Edinburgh
P. Bratley
Affiliation:
The Atlas Computer Laboratory, Chilton, Didcot; University of Edinburgh; Magdalen College, Oxford; University of Edinburgh
I. G. Macdonald
Affiliation:
The Atlas Computer Laboratory, Chilton, Didcot; University of Edinburgh; Magdalen College, Oxford; University of Edinburgh
J. K. S. McKay
Affiliation:
The Atlas Computer Laboratory, Chilton, Didcot; University of Edinburgh; Magdalen College, Oxford; University of Edinburgh
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

1. It was known to Euler that p(n), the number of unrestricted partitions of n into non-increasing integral parts, is generated by

with the usual convention that p(0) = 1.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1967