B sequence.sagews

#NOTE: this program requires downloading and extracting the carmichael-16 file from http://www.chalcedon.demon.co.uk/rgep/cartable.html
from itertools import permutations
carms = []
with open('carmichael-16', 'r') as f:
    for line in f:
        tokens = map(int, line.split())
        num = tokens[0]
        carms.append(num)
def is_quadratic_residue(m,n):
    if gcd(m,n)>1:
        return False
    for p in factor(n):
        if kronecker(m,p) == -1:
            return False
    return True
def b(n):
    for i, x in enumerate(carms):
        for p in permutations(carms[:i], n):
            if all(is_quadratic_residue(p[j], p[j+1]) for j in range(len(p)-1)) and is_quadratic_residue(p[len(p)-1], x):
                print x
                break
        else:
            continue
        break
# ~~~~

3 52633