login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A325393
Number of integer partitions of n whose k-th differences are strictly decreasing for all k >= 0.
10
1, 1, 1, 2, 2, 3, 3, 4, 5, 5, 6, 8, 7, 9, 11, 10, 12, 15, 13, 16, 19, 18, 20, 24, 22, 26, 29, 28, 31, 37, 33, 38, 43, 42, 44, 52, 48, 55, 59, 58, 62, 72, 65, 74, 80, 80, 82, 94, 88, 99, 103, 104, 108, 123, 114, 126, 133, 135, 137, 155, 145, 161, 166, 169, 174
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 A325399.
EXAMPLE
The a(1) = 1 through a(9) = 5 partitions:
(1) (2) (3) (4) (5) (6) (7) (8) (9)
(21) (31) (32) (42) (43) (53) (54)
(41) (51) (52) (62) (63)
(61) (71) (72)
(431) (81)
MATHEMATICA
Table[Length[Select[IntegerPartitions[n], And@@Table[Greater@@Differences[#, k], {k, 0, Length[#]}]&]], {n, 0, 30}]
KEYWORD
nonn
AUTHOR
Gus Wiseman, May 02 2019
STATUS
approved