OFFSET
2,3
COMMENTS
As shown in the example below, for each n, every row sums to n. The rows are a subset of rows in A080576, which lists all partitions of n in graded reflected lexicographic order. Currently, the rows for n=7 are not proved. They are assumed to be {1, 3, 3}, {1, 2, 4}, {3, 4}, {1, 1, 5}, {2, 5}, {1, 6}, {7}.
LINKS
Andrew Bremner and Maciej Ulas, On the reducibility type of trinomials, arxiv 1112.4267
EXAMPLE
The first rows:
1, 1
2
1, 1, 1
1, 2
3
1, 1, 2
2, 2
1, 3
4
1, 2, 2
1, 1, 3
2, 3
1, 4
5
CROSSREFS
KEYWORD
nonn,tabf,more
AUTHOR
T. D. Noe, Dec 20 2011
STATUS
approved