OFFSET
1,3
COMMENTS
We study weakly decreasing index paths in two-dimensional arrays that sum up to a given total t if evaluated by a generating function A. The arrays are denoted by A(n, k) for n >= 0 and k >= 0. A path is a list of index pairs W = [i_0, i_1, ..., i_m] where the index pairs i_j = (n_j, k_j) are subject to the condition that n_j > n_{j+1} and k_j >= k_{j+1}, and the values of the generating function A sum to a prescribed positive number t = Sum_{(n, k) in W} A(n, k).
Here we consider the array A139600 with the generating function P(n, k) = k + n * (k - 1) * k / 2 for n >= 0, k >= 2, supplemented by the condition P(n, 1) = 1 if n = 0 otherwise 0.
We call F = [(i, j) in W: P(i, j)] a 'figurative partition of n with weakly decreasing indices' if Sum(F) = n and call n the 'shape' and k the 'size' of P(n, k).
LINKS
Peter Luschny, Figurate number — a very short introduction. With plots from Stefan Friedrich Birkner.
Peter Luschny, List of the partitions for 1 <= n <= 12.
EXAMPLE
Some figurative partitions of 27 are, in the format '(shape, size) value':
(6, 3) 21 + (2, 2) 4 + (0, 2) 2;
(5, 3) 18 + (3, 2) 5 + (1, 2) 3 + (0, 1) 1;
(5, 3) 18 + (1, 3) 6 + (0, 3) 3;
(4, 3) 15 + (3, 2) 5 + (2, 2) 4 + (1, 2) 3.
CROSSREFS
KEYWORD
nonn
AUTHOR
Peter Luschny, Jul 14 2025
STATUS
approved
