Triangle-numbers with lots of divisors (Project-Euler Problem 12)
I'm going to focus on the coding style of your question, as there something to be said on that regard. On the subject of improving or alternate solution on how to do the Project Euler #12, see result of search here on Code Review for euler 12 [python].


Use better names for functions! – If you change your function names to sieve_of_eratoshenes and number_of_divisors you can remove the comments , and instead add proper docstrings explaining more on what the functions does or returns.
Use better names for variables – What are the c, d, d1´, andi` variables? They don't convey their meaning, which they really should. 
Avoid top level code inbetween functions – Between your functions you suddenly do primes = SE(13000), and then proceed to use this a global within nod(). Both are code smells. You should gather all of your top level code into a main(), pass the primes as a parameter and call main() like in the following:

import itertools

MAX_FACTOR = 13000
MAX_NUMBER = MAX_FACTOR ** 2

def main():
    primes = sieve_of_erasthones(MAX_FACTOR)

    divisor_count = 0

    for i in itertools.count(1):
        if i &gt; MAX_NUMBER:
            raise ValueError("Will fail as we don't have enough primes!")

        if i % 2 == 0:
           even_divisor_count = number_of_divisors(i+1)
        else:
             odd_divisor_count = number_of_divisors((i+1)//2)

        divisor_count = even_divisor_count * odd_divisor_count

        if divisor_count &gt;= 500:
            break

    print(i*(i-1)/2)


if __name__ == '__main__':
    main()


Do note that this code is untested, and I'm mostly unsure on what the i is and whether i &gt; MAX_NUMBER is the correct test
Possibly add an extension of primes table – Like suggested with i &gt; MAX_NUMBER you should add some sort of test to handle the situation when you run out of primes, and possibly build a method to extend the primes further. This could be done tracking current high, and reiterate over primes already found extending beyond the current high to the double of previous high or similar
Loop on the loop counter – As seen in the code above, I've changed your loop into looping on the i instead of resorting to manually updating the i within the while loop. To still maintain the same functionality, I've added the break statemen as a termination clause on the loop instead. 
BUG: Your nod() function will return None if n &gt; max(primes) – Given that the highest number of primes is less than n your code will terminate the loop and return None. 
Is it correct to do nd *= t? – I haven't tested, and neither fully grasped your nod() function, but shouldn't it add t to the total number of divisors, and not multiply it?


So to summarize, I think you need to work a little on naming your variables and functions, and add a check for when you code will fail to prevent it producing false and erroneous results. And possibly add a method to extend the primes list if going beyond already calculated primes.