Efficient Calculation the Number of Partitions of the Set $\{1, 2, \ldots, 3n\}$ into Subsets $\{x, y, z\}$ Satisfying $x+y=z$ (Q6442227)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 900598300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient Calculation the Number of Partitions of the Set $\{1, 2, \ldots, 3n\}$ into Subsets $\{x, y, z\}$ Satisfying $x+y=z$ |
scientific article; zbMATH DE number 900598300 |
Statements
1 July 2023
0 references
