|
| |
|
|
A026791
|
|
Triangle in which n-th row lists juxtaposed lexicographically ordered partitions of n; e.g. the partitions of 3 (1+1+1,1+2,3) appear as 1,1,1,1,2,3 in row 3.
|
|
3
| |
|
|
1, 1, 1, 2, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 2, 1, 3, 2, 2, 4, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1, 2, 2, 1, 4, 2, 3, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 2, 2, 1, 1, 4, 1, 2, 3, 1, 5, 2, 2, 2, 2, 4, 3, 3, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 1, 4, 1, 1, 2, 3, 1, 1, 5
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
COMMENTS
| Differs from A080576 in a(18): Here, (...,1+3,2+2,4), there (...,2+2,1+3,4).
|
|
|
LINKS
| Alois P. Heinz, Rows n = 1..19, flattened
|
|
|
EXAMPLE
| First six rows are:
[[1]]
[[1, 1], [2]]
[[1, 1, 1], [1, 2], [3]]
[[1, 1, 1, 1], [1, 1, 2], [1, 3], [2, 2], [4]]
[[1, 1, 1, 1, 1], [1, 1, 1, 2], [1, 1, 3], [1, 2, 2], [1, 4], [2, 3], [5]]
[[1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 2], [1, 1, 1, 3], [1, 1, 2, 2],
[1, 1, 4], [1, 2, 3], [1, 5], [2, 2, 2], [2, 4], [3, 3], [6]]
|
|
|
MAPLE
| T:= proc(n) local b, ll;
b:= proc(n, l)
if n=0 then ll:= ll, l[]
else seq (b(n-i, [l[], i]), i=`if`(l=[], 1, l[-1])..n)
fi
end;
ll:= NULL; b(n, []); ll
end:
seq (T(n), n=1..8); # Alois P. Heinz, Jul 16 2011
|
|
|
CROSSREFS
| Row lengths are given in A006128. Partition lengths are in A193173. Other partition orderings: A036036, A036037, A080576, A080577, A139100, A181087, A181317, A182937, A193073.
Sequence in context: A140225 A104758 A143227 * A080576 A194673 A083671
Adjacent sequences: A026788 A026789 A026790 * A026792 A026793 A026794
|
|
|
KEYWORD
| nonn,tabf
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu)
|
| |
|
|
