|
|
A236000
|
|
Triangle read by rows in which row n lists the overpartitions of n in colexicographic order.
|
|
8
|
|
|
1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 3, 1, 3, 1, 3, 1, 2, 2, 2, 2, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,7
|
|
COMMENTS
|
In the data section the overlined parts cannot be represented correctly, therefore the sequence represents all possible suborderings generated by the overlined parts.
The diagram in the second part of the Example section shows only one of the possible suborderings.
The equivalent sequence for partitions is A211992.
The equivalent sequence for compositions is A228525.
See both sequences for more information.
Row n contains A015128(n) overpartitions.
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
[1], [1];
[1, 1], [1, 1], [2], [2];
[1, 1, 1], [1, 1, 1], [2, 1], [2, 1], [2, 1], [2, 1], [3], [3];
[1, 1, 1, 1], [1, 1, 1, 1], [2, 1, 1], [2, 1, 1], [2, 1, 1], [2, 1, 1], [3, 1], [3, 1], [3, 1], [3, 1], [2, 2], [2, 2], [4], [4];
...
Illustration of initial terms (n: 1..4)
-----------------------------------------
n Diagram Overpartition
-----------------------------------------
. _
1 |.| 1',
1 |_| 1;
. _ _
2 |.| | 1', 1,
2 |_| | 1, 1,
2 | .| 2',
2 |_ _| 2;
. _ _ _
3 |.| | | 1', 1, 1,
3 |_| | | 1, 1, 1,
3 | .|.| 2', 1',
3 | |.| 2, 1',
3 | .| | 2', 1,
3 |_ _| | 2, 1,
3 | .| 3',
3 |_ _ _| 3;
. _ _ _ _
4 |.| | | | 1', 1, 1, 1,
4 |_| | | | 1, 1, 1, 1,
4 | .|.| | 2', 1', 1,
4 | |.| | 2, 1', 1,
4 | .| | | 2', 1, 1,
4 |_ _| | | 2, 1, 1,
4 | .|.| 3', 1',
4 | |.| 3, 1',
4 | .| | 3', 1,
4 |_ _ _| | 3, 1,
4 | .| | 2', 2,
4 |_ _| | 2, 2,
4 | .| 4',
4 |_ _ _ _| 4;
.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|