Number of ways to get n by evaluating 1 (+ or *) 2 (+ or *) 3 ... (+ or *) m for some positive integer m. No parentheses are allowed and the usual order of precedence (* before +) is followed.
A090787
Number of ways to get n by evaluating 1 (+ or *) 2 (+ or *) 3 ... (+ or *) m for some positive integer m. No parentheses are allowed and the usual order of precedence (* before +) is followed.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =0a(4) =1a(5) =2a(6) =1a(7) =0a(8) =1a(9) =2a(10) =1a(11) =0a(12) =0a(13) =2a(14) =3a(15) =1a(16) =0a(17) =0a(18) =1a(19) =2a(20) =2a(21) =1a(22) =0a(23) =1a(24) =3a(25) =3a(26) =2a(27) =2a(28) =2a(29) =1
External references
- oeis: A090787