Number of partitions of n into parts which are a sum of exactly as many distinct powers of 2 as n has 1's in its binary representation.
A091891
Number of partitions of n into parts which are a sum of exactly as many distinct powers of 2 as n has 1's in its binary representation.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =4a(5) =1a(6) =2a(7) =1a(8) =10a(9) =3a(10) =2a(11) =1a(12) =5a(13) =1a(14) =2a(15) =1a(16) =36a(17) =6a(18) =12a(19) =1a(20) =11a(21) =3a(22) =2a(23) =1a(24) =24a(25) =3a(26) =3a(27) =1a(28) =5a(29) =1
External references
- oeis: A091891