A325391 Number of reversed integer partitions of n whose k-th differences are strictly increasing for all k >= 0.

1, 1, 1, 2, 2, 3, 3, 5, 5, 6, 8, 9, 9, 13, 13, 15, 19, 20, 20, 28, 28, 30, 36, 40, 40, 50, 50, 56, 64, 68, 68, 86, 86, 92, 102, 112, 114, 133, 133, 146, 158, 173, 173, 202, 202, 215, 237, 256, 256, 287, 287, 324, 340, 359, 359, 403, 423, 446, 464, 495, 495

Offset

0,4

Comments

The differences of a sequence are defined as if the sequence were increasing, so for example the differences of (6,3,1) are (-3,-2).

The zeroth differences of a sequence are the sequence itself, while the k-th differences for k > 0 are the differences of the (k-1)-th differences.

The Heinz numbers of these partitions are given by A325398.

Links

Table of n, a(n) for n=0..60.

Gus Wiseman, Sequences counting and ranking integer partitions by the differences of their successive parts.

Example

The a(1) = 1 through a(9) = 6 reversed partitions:
  (1)  (2)  (3)   (4)   (5)   (6)   (7)    (8)    (9)
            (12)  (13)  (14)  (15)  (16)   (17)   (18)
                        (23)  (24)  (25)   (26)   (27)
                                    (34)   (35)   (36)
                                    (124)  (125)  (45)
                                                  (126)
The smallest reversed strict partition with strictly increasing differences not counted by this sequence is (1,2,4,7), whose first and second differences are (1,2,3) and (1,1) respectively.

Mathematica

Table[Length[Select[Reverse/@IntegerPartitions[n], And@@Table[Less@@Differences[#, k], {k, 0, Length[#]}]&]], {n, 0, 30}]

Crossrefs

Cf. A179254, A240026, A325353, A325354, A325357, A325393, A325395, A325398, A325404, A325406, A325456, A325468.

Sequence in context: A211275 A240542 A342516 * A179254 A304430 A086609

Adjacent sequences: A325388 A325389 A325390 * A325392 A325393 A325394

Keyword

nonn

Author

Gus Wiseman, May 02 2019

Status

approved