genrator

def _ele_iter(): n=10 while True: n=n+1 yield n

judge

def is_palindrome(n):
    return lambda x:int(str(x))==int(str(x)[::-1])
def primes(n):
    yield 11
    it=_ele_iter()
    while True:
        n=next(it)
        yield n
        it=filter(is_palindrome(n),it)

output

for n in primes():
if n < 1000:
    print(n)
else: break