Number of ways to choose a multiset of values whose sum is n from the first floor(1+log_2(n)) rows of Pascal's triangle.

A366120

Number of ways to choose a multiset of values whose sum is n from the first floor(1+log_2(n)) rows of Pascal's triangle.

Terms

    a(0) =1a(1) =3a(2) =1a(3) =15a(4) =11a(5) =5a(6) =1a(7) =141a(8) =127a(9) =100a(10) =70a(11) =44a(12) =22a(13) =7a(14) =1a(15) =2453a(16) =2393a(17) =2249a(18) =2035a(19) =1784a(20) =1508a(21) =1222a(22) =948a(23) =694a(24) =472a(25) =302a(26) =182a(27) =95a(28) =37a(29) =9

External references