Shouldn't the sequence start with two of the highest values in your memoization container instead of (1,1)?

Frankly, all solutions here I saw but for 54d7ac's one (mathematically optimal, but won't scale to big integers, transformation matrix is better for that, although brings O(log(n)) instead of O(1)) are heavily suboptimal anyway so it depends what you aim for. ;) I aimed for Iterator approach.

Cheating, it doesn't work for any m >= 200. :-/

My solution in Nim passes all the tests but, oddly, the button doesn't change to Submit Final.

Just like you use div operator, use mod. It's much more natural than unsigned-mod %% operator.

x.toInt does the same as round(x).int but is shorter and (probably) more efficient.

Use a div b for integer division, not int(a / b).

Probably better than my own little obsession, namely: "I know it already passes tests but I can make it better composed/more general/nicer to read". ;)

I felt it's a bit un-pytonish to actually add methods to an existing class without no real reason.

That's probably what "clever" was supposed to mean on Codewars. ^^"

You're welcome. :) I enjoyed it so I'd like to translate other similar katas in the future.

No, it's a mistake, thank you for pointing it out. They were meant to be equal to 100 and 1000. I've corrected it.

Seems inefficient but shows how modular arithmetic works. And it does it well.

The problem is still there.