|
|
A353318
|
|
Irregular triangle read by rows where T(n,k) is the number of integer partitions of n with k excedances (parts above the diagonal), zeros omitted.
|
|
3
|
|
|
1, 1, 1, 1, 2, 1, 4, 1, 6, 1, 9, 1, 1, 12, 2, 1, 16, 5, 1, 20, 9, 1, 25, 16, 1, 30, 25, 1, 36, 39, 1, 1, 42, 56, 2, 1, 49, 80, 5, 1, 56, 109, 10, 1, 64, 147, 19, 1, 72, 192, 32, 1, 81, 249, 54, 1, 90, 315, 84, 1, 100, 396, 129, 1, 1, 110, 489, 190, 2, 1, 121, 600, 275, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1
1 1
1 2
1 4
1 6
1 9 1
1 12 2
1 16 5
1 20 9
1 25 16
1 30 25
1 36 39 1
1 42 56 2
1 49 80 5
1 56 109 10
For example, row n = 7 counts the following partitions:
(1111111) (7) (43)
(52) (331)
(61)
(322)
(421)
(511)
(2221)
(3211)
(4111)
(22111)
(31111)
(211111)
|
|
MATHEMATICA
|
partsabove[y_]:=Length[Select[Range[Length[y]], #<y[[#]]&]];
DeleteCases[Table[Length[Select[IntegerPartitions[n], partsabove[#]==k&]], {n, 1, 15}, {k, 0, n-1}], 0, 2]
|
|
CROSSREFS
|
The version for reversed partitions is A353319.
A001522 counts partitions with a fixed point, ranked by A352827 (unproved).
A064428 counts partitions w/o a fixed point, ranked by A352826 (unproved).
A238352 counts reversed partitions by fixed points, rank statistic A352822.
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|