cp's OEIS Frontend

A272187 Number of strongly decreasing partitions of n into odd parts.

%I A272187 #9 Apr 22 2016 06:30:03
%S A272187 1,1,0,1,1,1,1,1,2,2,2,2,3,3,3,3,4,5,4,5,6,7,6,7,8,10,8,10,11,13,11,
%T A272187 13,14,17,14,17,19,21,19,21,24,27,24,27,31,33,31,33,38,41,38,41,48,49,
%U A272187 48,49,58,60,58,60,71,71,71,71,84,85,84,85,101,99,101,99,118,118,118,118,139,137,139
%N A272187 Number of strongly decreasing partitions of n into odd parts.
%C A272187 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) ).
%H A272187 Joerg Arndt, <a href="/A272187/b272187.txt">Table of n, a(n) for n = 0..1000</a>
%e A272187 The a(30) = 11 such partitions are:
%e A272187 01:   [ 17 7 5 1 ]
%e A272187 02:   [ 17 9 3 1 ]
%e A272187 03:   [ 17 13 ]
%e A272187 04:   [ 19 7 3 1 ]
%e A272187 05:   [ 19 11 ]
%e A272187 06:   [ 21 5 3 1 ]
%e A272187 07:   [ 21 9 ]
%e A272187 08:   [ 23 7 ]
%e A272187 09:   [ 25 5 ]
%e A272187 10:   [ 27 3 ]
%e A272187 11:   [ 29 1 ]
%Y A272187 Cf. A187821 (non-squashing partitions of n into odd parts), A040039 (strongly decreasing partitions).
%K A272187 nonn
%O A272187 0,9
%A A272187 _Joerg Arndt_, Apr 22 2016