This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A089053 #6 Mar 07 2021 17:52:34
%S A089053 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 A089053 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 A089053 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 A089053 Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = number of partitions of n into exactly k powers of 2.
%t A089053 T[n_, k_] := T[n, k] = Which[k > n, 0, k == 0, If[n == 0, 1, 0], Mod[n, 2] == 1, T[n - 1, k - 1], True, T[n - 1, k - 1] + T[n/2, k]];
%t A089053 Table[T[n, k], {n, 1, 14}, {k, 1, n}] // Flatten (* _Jean-François Alcover_, Mar 07 2021 *)
%Y A089053 See A089052, which is the main entry for this triangle.
%K A089053 nonn,tabl
%O A089053 0,18
%A A089053 _N. J. A. Sloane_, Dec 03 2003