Collatz Sequence

Start with n. If it is even, divide it by 2; if it is odd, multiply it by 3 and add 1. Repeat until the value is 1. Include both the starting value and the final 1 in your answer.

Implement collatz_sequence(n).

Input

n: The positive starting integer.

Output

Return the complete sequence in order.

Contraintes

1 ≤ n ≤ 10,000. Inputs in this range reach 1 under this rule; all sequence values fit a signed 64-bit integer.

Exemples

Entrée :
n = 6

Sortie attendue :
expected = [6, 3, 10, 5, 16, 8, 4, 2, 1]

Entrée :
long long n = 6;

Sortie attendue :
std::vector<long long> expected = {6, 3, 10, 5, 16, 8, 4, 2, 1};

Entrée :
long n = 6;

Sortie attendue :
long[] expected = new long[] {6, 3, 10, 5, 16, 8, 4, 2, 1};

Entrée :
n = 1

Sortie attendue :
expected = [1]

Entrée :
long long n = 1;

Sortie attendue :
std::vector<long long> expected = {1};

Entrée :
long n = 1;

Sortie attendue :
long[] expected = new long[] {1};

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

• #39 Collatz Sequence