|
|
A242628
|
|
Irregular table enumerating partitions; n-th row has partitions in previous row with each part incremented, followed by partitions in previous row with an additional part of size 1.
|
|
20
|
|
|
1, 2, 1, 1, 3, 2, 2, 2, 1, 1, 1, 1, 4, 3, 3, 3, 2, 2, 2, 2, 3, 1, 2, 2, 1, 2, 1, 1, 1, 1, 1, 1, 5, 4, 4, 4, 3, 3, 3, 3, 4, 2, 3, 3, 2, 3, 2, 2, 2, 2, 2, 2, 4, 1, 3, 3, 1, 3, 2, 1, 2, 2, 2, 1, 3, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 6, 5, 5, 5, 4, 4, 4, 4, 5, 3, 4, 4, 3, 4, 3, 3, 3, 3, 3, 3, 5, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This can be calculated using the binary expansion of n; see the PARI program.
The n-th row consists of all partitions with hook size (maximum + number of parts - 1) equal to n.
The partitions in row n of this sequence are the conjugates of the partitions in row n of A125106 taken in reverse order.
Row n is also the reversed partial sums plus one of the n-th composition in standard order (A066099) minus one. - Gus Wiseman, Nov 07 2022
|
|
LINKS
|
|
|
EXAMPLE
|
The table starts:
1;
2; 1,1;
3; 2,2; 2,1; 1,1,1;
4; 3,3; 3,2; 2,2,2; 3,1 2,2,1 2,1,1 1,1,1,1;
...
|
|
MAPLE
|
b:= proc(n) option remember; `if`(n=1, [[1]],
[map(x-> map(y-> y+1, x), b(n-1))[],
map(x-> [x[], 1], b(n-1))[]])
end:
T:= n-> map(x-> x[], b(n))[]:
|
|
MATHEMATICA
|
T[1] = {{1}};
T[n_] := T[n] = Join[T[n-1]+1, Append[#, 1]& /@ T[n-1]];
|
|
PROG
|
(PARI) apart(n) = local(r=[1]); while(n>1, if(n%2==0, for(k=1, #r, r[k]++), r=concat(r, [1])); n\=2); r \\ Generates n-th partition.
|
|
CROSSREFS
|
First element in each row is A008687.
Last element in each row is A065120.
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|