OFFSET
0,4
COMMENTS
The partitions are represented as weakly increasing lists of parts.
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..400
EXAMPLE
There are a(13) = 23 such partitions of 13:
01: [ 1 2 3 7 ]
02: [ 1 2 4 6 ]
03: [ 1 2 5 5 ]
04: [ 1 2 10 ]
05: [ 1 3 3 6 ]
06: [ 1 3 4 5 ]
07: [ 1 3 9 ]
08: [ 1 4 4 4 ]
09: [ 1 4 8 ]
10: [ 1 5 7 ]
11: [ 1 6 6 ]
12: [ 1 12 ]
13: [ 2 3 8 ]
14: [ 2 4 7 ]
15: [ 2 5 6 ]
16: [ 2 11 ]
17: [ 3 4 6 ]
18: [ 3 5 5 ]
19: [ 3 10 ]
20: [ 4 9 ]
21: [ 5 8 ]
22: [ 6 7 ]
23: [ 13 ]
CROSSREFS
Cf. A238861 (compositions with superdiagonal growth), A000009 (partitions into distinct parts have superdiagonal growth by definition).
Cf. A238859 (compositions of n with subdiagonal growth), A238876 (partitions with subdiagonal growth), A001227 (partitions into distinct parts with subdiagonal growth).
Cf. A008930 (subdiagonal compositions), A238875 (subdiagonal partitions), A010054 (subdiagonal partitions into distinct parts).
KEYWORD
nonn
AUTHOR
Joerg Arndt, Mar 24 2014
STATUS
approved