```python
def odd_bit_set_number(n):
    """
    Sets all odd-positioned bits of a given number.

    Bit positions are 0-indexed from the right (least significant bit).
    Odd positions are 1, 3, 5, and so on.

    Args:
        n: An integer.

    Returns:
        An integer with all its odd-positioned bits set to 1,
        while preserving the even-positioned bits from the original number.
    """
    mask = 0
    num_bits = n.bit_length()

    # Create a mask with 1s at all odd bit positions up to the length of n.
    # We iterate through odd indices (1, 3, 5, ...)
    for i in range(1, num_bits + 1, 2):
        # Set the i-th bit in the mask.
        mask |= (1 << i)

    # Use a bitwise OR to apply the mask to the number.
    # This sets the bits in n that are 1 in the mask,
    # and leaves the other bits (even-positioned ones) unchanged.
    return n | mask
```