gcd(a,b) is the greatest common divisor of a and b. It is the greatest number that can divide a and b.
example gcd(10,50) = 10 and gcd(5,7) = 1

For some reasons this solution requires you to only check if the version inside the given data is valid. No need to check the version parameter. The description is a little misleading/confusing.

You can click on padovan in the kata description. Or here.

i made a function for very "nacci" sequence in this kata and search every were to see if all those sequences are ok! in every site that i search they all match but don't get to complete this kata since for me the padovan sequence is wrong

padovan sequence = 1, 1, 1, 2, 2, 3, 4, 5, 7, 9, 12, 16, 21, 28, 37, 49, 65, 86, 114, 151, 200, 265

I want to know where did you get the sequences from?

I´m in trouble on generating the numbers because i don't know what this mean gcd(n, a(n-1)), can anyone give me some tips on this

pass the small and the medium but not random and big one :(