|
%I #9 Oct 18 2019 07:58:21
%S 1,0,1,1,0,1,1,0,0,1,3,0,0,0,1,3,1,0,0,0,1,6,1,0,0,0,0,1,7,2,0,0,0,0,
%T 0,1,12,2,1,0,0,0,0,0,1,14,4,1,0,0,0,0,0,0,1,22,4,2,0,0,0,0,0,0,0,1,
%U 27,6,2,1,0,0,0,0,0,0,0,1,40,7,3,1,0,0,0,0,0,0
%N Triangular array O by rows: O(n,k) = number of partitions of n into an odd number of parts, the least being k.
%F O(n, k) = E(n-k, k)+E(n-k, k+1)+...+E(n-k, n-k), for 2<=2k<=n, E given by A027186.
%F T(n,k) + A027186(n,k) = A026794(n,k). - _R. J. Mathar_, Oct 18 2019
%e 1,
%e 0, 1,
%e 1, 0, 1,
%e 1, 0, 0, 1,
%e 3, 0, 0, 0, 1,
%e 3, 1, 0, 0, 0, 1,
%e 6, 1, 0, 0, 0, 0, 1,
%e 7, 2, 0, 0, 0, 0, 0, 1,
%e 12, 2, 1, 0, 0, 0, 0, 0, 1,
%e 14, 4, 1, 0, 0, 0, 0, 0, 0, 1,
%e 22, 4, 2, 0, 0, 0, 0, 0, 0, 0, 1,
%e 27, 6, 2, 1, 0, 0, 0, 0, 0, 0, 0, 1,
%e 40, 7, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1,
%Y Cf. A027186.
%K nonn,tabl
%O 1,11
%A _Clark Kimberling_
|
