The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com
0,9
A strongly decreasing partition of n is a partition p(1) + p(2) + ... + p(m) = n such that p(k) > sum(j=k+1..m, p(j) ).
Joerg Arndt, Table of n, a(n) for n = 0..1000
The a(30) = 11 such partitions are:
01: [ 17 7 5 1 ]
02: [ 17 9 3 1 ]
03: [ 17 13 ]
04: [ 19 7 3 1 ]
05: [ 19 11 ]
06: [ 21 5 3 1 ]
07: [ 21 9 ]
08: [ 23 7 ]
09: [ 25 5 ]
10: [ 27 3 ]
11: [ 29 1 ]
Cf. A187821 (non-squashing partitions of n into odd parts), A040039 (strongly decreasing partitions).
Sequence in context: A091226 A097913 A029269 * A194621 A088004 A070548
Adjacent sequences: A272184 A272185 A272186 * A272188 A272189 A272190
nonn
Joerg Arndt, Apr 22 2016
approved