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

%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

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 May 26 13:05 EDT 2019. Contains 323586 sequences. (Running on oeis4.)