OTOH, You need not to go from 1 up to n. You should find an optimal stopping point / upper-boundary where you can obtain all the divisors of n.

You don't need all of them.

To be executed a function needs to be called. And however prime_list doesn't exist for for your main function, it is enclosed inside your sieve function. You should work on easier katas in order to get familiar with some concept of basic Python programming. This is too much debugging at the time.

This code throws an error:

NameError: name 'prime_list' is not defined

Still not.

Those are not the correct tags to format code, please follow https://docs.codewars.com/references/markdown/#code-block

And always use a spoiler flag when you post code.

Please use markdown tags for format your code or it's unusable, see there: https://docs.codewars.com/training/troubleshooting/#post-discourse

You posted twice the same message, can you remove the one above please?