OFFSET
1,3
COMMENTS
This is the original sequence of a large number of sequences connected with the section model of partitions.
Here "the n-th section of the set of partitions of any integer greater than or equal to n" (hence "the last section of the set of partitions of n") is defined to be the set formed by all parts that occur as a result of taking all partitions of n and then removing all parts of the partitions of n-1. For integers greater than 1 the structure of a section has two main areas: the head and tail. The head is formed by the partitions of n that do not contain 1 as a part. The tail is formed by A000041(n-1) partitions of 1. The set of partitions of n contains the sets of partitions of the previous numbers. The section model of partitions has several versions according with the ordering of the partitions or with the representation of the sections. In this sequence we use the ordering of A026791.
The section model of partitions can be interpreted as a table of partitions. See also A138121. - Omar E. Pol, Nov 18 2009
It appears that the versions of the model show an overlapping of sections and subsections of the numbers congruent to k mod m into parts >= m. For example:
First generation (the main table):
Table 1.0: Partitions of integers congruent to 0 mod 1 into parts >= 1.
Second generation:
Table 2.0: Partitions of integers congruent to 0 mod 2 into parts >= 2.
Table 2.1: Partitions of integers congruent to 1 mod 2 into parts >= 2.
Third generation:
Table 3.0: Partitions of integers congruent to 0 mod 3 into parts >= 3.
Table 3.1: Partitions of integers congruent to 1 mod 3 into parts >= 3.
Table 3.2: Partitions of integers congruent to 2 mod 3 into parts >= 3.
And so on.
Conjecture:
Let j and n be integers congruent to k mod m such that 0 <= k < m <= j < n. Let h=(n-j)/m. Consider only all partitions of n into parts >= m. Then remove every partition in which the parts of size m appears a number of times < h. Then remove h parts of size m in every partition. The rest are the partitions of j into parts >= m. (Note that in the section model, h is the number of sections or subsections removed), (Omar E. Pol, Dec 05 2010, Dec 06 2010).
Starting from the first row of triangle, it appears that the total numbers of parts of size k in k successive rows give the sequence A000041 (see A182703). - Omar E. Pol, Feb 22 2012
LINKS
Alois P. Heinz, Rows n = 1..23, flattened
Omar E. Pol, Illustration of the section model of partitions
EXAMPLE
Triangle begins:
[1];
[1],[2];
[1],[1],[3];
[1],[1],[1],[2,2],[4];
[1],[1],[1],[1],[1],[2,3],[5];
[1],[1],[1],[1],[1],[1],[1],[2,2,2],[2,4],[3,3],[6];
...
From Omar E. Pol, Sep 03 2013: (Start)
Illustration of initial terms (n = 1..6). The table shows the six sections of the set of partitions of 6 in three ways. Note that before the dissection, the set of partitions was in the ordering mentioned in A026791. More generally, the six sections of the set of partitions of 6 also can be interpreted as the first six sections of the set of partitions of any integer >= 6.
---------------------------------------------------------
n j Diagram Parts Parts
---------------------------------------------------------
. _
1 1 |_| 1; 1;
. _
2 1 | |_ 1, 1,
2 2 |_ _| 2; 2;
. _
3 1 | | 1, 1,
3 2 | |_ _ 1, 1,
3 3 |_ _ _| 3; 3;
. _
4 1 | | 1, 1,
4 2 | | 1, 1,
4 3 | |_ _ _ 1, 1,
4 4 | |_ _| 2,2, 2,2,
4 5 |_ _ _ _| 4; 4;
. _
5 1 | | 1, 1,
5 2 | | 1, 1,
5 3 | | 1, 1,
5 4 | | 1, 1,
5 5 | |_ _ _ _ 1, 1,
5 6 | |_ _ _| 2,3, 2,3,
5 7 |_ _ _ _ _| 5; 5;
. _
6 1 | | 1, 1,
6 2 | | 1, 1,
6 3 | | 1, 1,
6 4 | | 1, 1,
6 5 | | 1, 1,
6 6 | | 1, 1,
6 7 | |_ _ _ _ _ 1, 1,
6 8 | | |_ _| 2,2,2, 2,2,2,
6 9 | |_ _ _ _| 2,4, 2,4,
6 10 | |_ _ _| 3,3, 3,3,
6 11 |_ _ _ _ _ _| 6; 6;
...
(End)
MAPLE
with(combinat):
T:= proc(m) local b, ll;
b:= proc(n, i, l)
if n=0 then ll:=ll, l[]
else seq(b(n-j, j, [l[], j]), j=i..n)
fi
end;
ll:= NULL; b(m, 2, []); [1$numbpart(m-1)][], ll
end:
seq(T(n), n=1..10); # Alois P. Heinz, Feb 19 2012
MATHEMATICA
less[run1_, run2_] := (lg1 = run1 // Length; lg2 = run2 // Length; lg = Max[lg1, lg2]; r1 = If[lg1 == lg, run1, PadRight[run1, lg, 0]]; r2 = If[lg2 == lg, run2, PadRight[run2, lg, 0]]; Order[r1, r2] != -1); row[n_] := Join[ Array[1 &, {PartitionsP[n - 1]}], Sort[ Reverse /@ Select[ IntegerPartitions[n], FreeQ[#, 1] &], less] ] // Flatten; Table[row[n], {n, 1, 9}] // Flatten (* Jean-François Alcover, Jan 14 2013 *)
Table[Reverse@ConstantArray[{1}, PartitionsP[n - 1]]~Join~
DeleteCases[Sort@PadRight[Reverse/@Cases[IntegerPartitions[n], x_ /; Last[x] != 1]], x_ /; x == 0, 2], {n, 1, 9}] // Flatten (* Robert Price, May 12 2020 *)
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Omar E. Pol, Nov 17 2007, Mar 21 2008
STATUS
approved