Given a triangle of consecutive odd numbers:

```
             1
          3     5
       7     9    11
   13    15    17    19
21    23    25    27    29
...
```

find the triangle's row knowing its index (the rows are 1-indexed), e.g.:

```
odd_row(1)  ==  [1]
odd_row(2)  ==  [3, 5]
odd_row(3)  ==  [7, 9, 11]
```

**Note**: your code should be optimized to handle big inputs.

___

The idea for this kata was taken from this kata: [Sum of odd numbers](https://www.codewars.com/kata/sum-of-odd-numbers)

Difficulty: EASY
Starter code: def odd_row(n):
	

Solutions:
odd_row = lambda n: list(range(n * (n - 1) + 1, n * (n + 1), 2))


def odd_row(n):
	m = (n - 1) * n + 1
	return [*range(m, m + n * 2, 2)]


def odd_row(n):
	return [x for x in range(n ** 2 - n + 1, (n + 1) ** 2 - n, 2)]


def odd_row(n):
	return [x for x in range(n * n - n, n * n + n) if x % 2 != 0]


def odd_row(n):
	return list(range(n ** 2 - n + 1, n ** 2 + n, 2))


def odd_row(n):
	row = [i for i in range(n ** 2 - n + 1, n ** 2 + n, 2)]
	return row
	return


def odd_row(n):
	arr = []
	value = n * n - (n - 1)
	for i in range(n):
		arr.append(value)
		value += 2
	return arr