```python
def is_woodall(x):
    """
    Checks if a number x is a Woodall number.
    A Woodall number is of the form W_n = n * 2^n - 1 for n >= 1.
    """
    # The sequence of Woodall numbers for n >= 1 starts with W_1 = 1.
    # Therefore, any number less than 1 is not a Woodall number in this sequence.
    if x < 1:
        return False

    n = 1
    while True:
        # Calculate the nth Woodall number. Using a bit shift (1 << n) for 2**n
        # is efficient.
        woodall_candidate = n * (1 << n) - 1

        # If the candidate matches x, then x is a Woodall number.
        if woodall_candidate == x:
            return True

        # The Woodall sequence is strictly increasing for n >= 1.
        # If the candidate exceeds x, no subsequent candidate will match.
        if woodall_candidate > x:
            return False

        # Check the next value of n.
        n += 1
```