Sequences of given length where every element is more than or equal to twice of previous
Given two integers n and m, the task is to determine the total number of special sequences of length n such that: seq[i+1] >= 2 * seq[i]seq[i] > 0seq[i] <= mExamples : Input: n = 4, m = 10Output: 4Explanation: The sequences are [1, 2, 4, 8], [1, 2, 4, 9], [1, 2, 4, 10], [1, 2, 5, 10] Input: