You can if you start at index 1, like you did, instead of starting at index 0 and checking next element. It doesn't matter.

You could've get rid of the last loop just by multiplying the value of num by k + 1.

Another kata similar to this one? I loved this one.

Don't know much about that, but a pretty basic way to measure times is getting the time before execution then subtract that time to the time after execution, that could give you time execution, "could" because it's not consistent for several reasons, like, it depends on the specs of your device, programs you're running, etcetera, so this is just like an archaic way. Actual pros analyze the time and space complexity of the algorithm as a whole, considering the size of the inputs, cost of each function call, loops, and more stuff, which I don't have any knowledge on those topics.

Ahh HAHAHAHAHAHAHA.

Kata description says:

We will call the series seeded by a value of 1 the "base series"

what is the "base series"?

Did you finish it?

Sounds like Python. Also sounds like your function does not return a value.

'None should equal 283' - what it means?

Does it mean that function should be able to process something else except numbers?

Tests are not supposed to time out. That wouldn't make sense.

please add to instructions that large inputs cause timeout, I spent the last two hours banging my head against the wall trying to figure out what's wrong with my code

Yes, of course.

No. 3100 would be 3103 !

Yes. 3000 would be 3003. 3100 would also be 3003.