Let QR be the set of quadratic residues mod n: QR = {x^2 mod n, 1 <= x <= n-1}. Let MR be the set of values taken by 2^x mod n: MR = {2^x mod n, 0 <= x <= n-2}. Usually if QR is a subset of MR then n is prime and otherwise n is composite. Sequence gives numbers that violate this rule, i.e., composites where QR is a subset of MR and primes where QR is not a subset of MR.

A082595

Let QR be the set of quadratic residues mod n: QR = {x^2 mod n, 1 <= x <= n-1}. Let MR be the set of values taken by 2^x mod n: MR = {2^x mod n, 0 <= x <= n-2}. Usually if QR is a subset of MR then n is prime and otherwise n is composite. Sequence gives numbers that violate this rule, i.e., composites where QR is a subset of MR and primes where QR is not a subset of MR.

Terms

    a(0) =4a(1) =8a(2) =31a(3) =43a(4) =73a(5) =89a(6) =109a(7) =113a(8) =127a(9) =151a(10) =157a(11) =223a(12) =229a(13) =233a(14) =241a(15) =251a(16) =257a(17) =277a(18) =281a(19) =283a(20) =307a(21) =331a(22) =337a(23) =353a(24) =397a(25) =431a(26) =433a(27) =439a(28) =457a(29) =499

External references