OFFSET
0,3
COMMENTS
The Dyson rank of a nonempty partition is its maximum part minus its length. The rank of an empty partition is undefined.
LINKS
Freeman J. Dyson, A new symmetry of partitions, Journal of Combinatorial Theory 7.1 (1969): 56-61.
FindStat, St000145: The Dyson rank of a partition
FORMULA
Having odd rank is preserved under conjugation, and self-conjugate partitions cannot have odd rank, so a(n) = 2*A101707(n) for n > 0.
EXAMPLE
The a(0) = 0 through a(9) = 12 partitions (empty columns indicated by dots):
. . (2) . (4) (32) (6) (52) (8) (54)
(11) (31) (221) (33) (421) (53) (72)
(211) (51) (3211) (71) (432)
(1111) (222) (22111) (422) (441)
(411) (431) (621)
(3111) (611) (3222)
(21111) (3221) (3321)
(111111) (3311) (5211)
(5111) (22221)
(22211) (42111)
(41111) (321111)
(311111) (2211111)
(2111111)
(11111111)
MATHEMATICA
Table[Length[Select[IntegerPartitions[n], OddQ[Max[#]-Length[#]]&]], {n, 0, 30}]
CROSSREFS
Note: A-numbers of Heinz-number sequences are in parentheses below.
The strict case is A117193.
The Heinz numbers of these partitions are (A340603).
A072233 counts partitions by sum and length.
A168659 counts partitions whose length is divisible by maximum.
A200750 counts partitions whose length and maximum are relatively prime.
- Rank -
A257541 gives the rank of the partition with Heinz number n.
- Odd -
A026804 counts partitions whose least part is odd.
A339890 counts factorizations of odd length.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jan 29 2021
STATUS
approved