login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089053 Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = number of partitions of n into exactly k powers of 2. 5
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 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

0,18

LINKS

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

CROSSREFS

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

Sequence in context: A211229 A316675 A111405 * A214979 A068462 A054973

Adjacent sequences:  A089050 A089051 A089052 * A089054 A089055 A089056

KEYWORD

nonn,tabl

AUTHOR

N. J. A. Sloane, Dec 03 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 04:48 EDT 2019. Contains 322412 sequences. (Running on oeis4.)