%I
%S 1,1,1,0,1,1,1,1,1,1,0,1,1,1,1,0,1,2,1,1,1,0,0,1,2,1,1,1,1,1,1,2,2,1,
%T 1,1,0,1,1,1,2,2,1,1,1,0,1,2,2,2,2,2,1,1,1,0,0,1,2,2,2,2,2,1,1,1,0,1,
%U 2,2,3,3,2,2,2,1,1,1,0,0,1,2,2,3,3,2,2,2,1,1,1,0,0,1,3,3,3,4,3,2,2,2,1,1,1
%N Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = number of partitions of n into exactly k powers of 2.
%Y See A089052, which is the main entry for this triangle.
%K nonn,tabl
%O 0,18
%A _N. J. A. Sloane_, Dec 03 2003
