Number of ways to reach a sum of n by a down-only cascade through Pascal's Triangle, starting at C(0,0)=1 at the apex and shifting left or right by exactly one position at each step.

A091820

Number of ways to reach a sum of n by a down-only cascade through Pascal's Triangle, starting at C(0,0)=1 at the apex and shifting left or right by exactly one position at each step.

Terms

    a(0) =1a(1) =2a(2) =2a(3) =4a(4) =2a(5) =4a(6) =6a(7) =4a(8) =2a(9) =6a(10) =6a(11) =6a(12) =8a(13) =4a(14) =4a(15) =10a(16) =2a(17) =6a(18) =6a(19) =6a(20) =8a(21) =14a(22) =12a(23) =4a(24) =6a(25) =6a(26) =4a(27) =10a(28) =6a(29) =6

External references