Question: 
Write a function to find the nth newman–shanks–williams prime number.


Model's Code:
def is_newman_prime(n):
    if n < 2:
        return False
    if n == 2:
        return True
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return all((n - k) % k != 0 for k in range(2, int(n**0.5) + 1))

def newman_prime(n):
    count, num = 0, 0
    while count < n:
        num += 1
        if is_newman_prime(num):
            count += 1
    return num



Sample Correct Code:
def newman_prime(n): 
	if n == 0 or n == 1: 
		return 1
	return 2 * newman_prime(n - 1) + newman_prime(n - 2)


Asserts:
assert newman_prime(3) == 7 
assert newman_prime(4) == 17
assert newman_prime(5) == 41


Tests:
Test 1 of 3: FAIL: AssertionError()

Test 260 of 974: 185/260 (71.15384615384616%): failed