A089053 Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = number of partitions of n into exactly k powers of 2.

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, 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, 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

Offset

0,18

Links

Table of n, a(n) for n=0..104.

Mathematica

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]];
Table[T[n, k], {n, 1, 14}, {k, 1, n}] // Flatten (* Jean-François Alcover, Mar 07 2021 *)

Crossrefs

See A089052, which is the main entry for this triangle.

Sequence in context: A335621 A316675 A111405 * A214979 A068462 A369596

Adjacent sequences: A089050 A089051 A089052 * A089054 A089055 A089056

Keyword

nonn,tabl

Author

N. J. A. Sloane, Dec 03 2003

Status

approved