|
|
|
|
#48 by Michael De Vlieger at Wed Jul 05 16:56:39 EDT 2023
|
|
|
|
#47 by Michel Marcus at Wed Jul 05 16:54:52 EDT 2023
|
|
|
|
#46 by Michael De Vlieger at Wed Jul 05 15:23:48 EDT 2023
|
|
|
|
#45 by Michael De Vlieger at Wed Jul 05 15:23:46 EDT 2023
|
| LINKS
|
Christian Hercher and Frank Niedermeyer, <a href="https://arxiv.org/abs/2307.00303">Efficient Calculation the Number of Partitions of the Set {1, 2, ..., 3n} into Subsets {x, y, z} Satisfying x + y = z</a>, arXiv:2307.00303 [math.CO], 2023.
|
| STATUS
|
approved
editing
|
|
|
|
#44 by Alois P. Heinz at Wed Nov 18 12:22:00 EST 2020
|
|
|
|
#43 by Alois P. Heinz at Wed Nov 18 12:20:53 EST 2020
|
|
|
|
#42 by Alois P. Heinz at Thu Apr 23 19:54:36 EDT 2020
|
|
|
|
#41 by Alois P. Heinz at Thu Apr 23 15:28:17 EDT 2020
|
|
|
Discussion
|
Thu Apr 23
| 15:28
| Alois P. Heinz: self ref ...
|
|
|
|
#40 by Alois P. Heinz at Thu Apr 23 15:22:14 EDT 2020
|
|
|
|
#39 by Alois P. Heinz at Thu Apr 23 15:22:12 EDT 2020
|
| NAME
|
Number of ways to split {1, 2, 3, ..., 3n } into n arithmetic progressions each with 3 terms.
|
| STATUS
|
approved
editing
|
|
|
|