Let's define a sequence S of positive integers where each element is either equal to twice the preceding element (or) more than twice the preceding element in that sequence.

Given two parameters, `len`

and `max_value`

, write a function which returns the total number of such sequences possible. The sequence should contain exactly `len`

number of elements and the maximum value in the sequence cannot exceed `max_value`

( but can be equal to it )

An example, just in case, the question is unclear.

`len`

= 4 `max_value`

= 10

The function should return 4.

because the possible sequences are:

```
[1,2,4,8]
[1,2,4,9]
[1,2,4,10]
[1,2,5,10]
```