Euler-Jacobi pseudoprimes: 2^((n-1)/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol.

Terms

a(0) =561a(1) =1105a(2) =1729a(3) =1905a(4) =2047a(5) =2465a(6) =3277a(7) =4033a(8) =4681a(9) =6601a(10) =8321a(11) =8481a(12) =10585a(13) =12801a(14) =15841a(15) =16705a(16) =18705a(17) =25761a(18) =29341a(19) =30121a(20) =33153a(21) =34945a(22) =41041a(23) =42799a(24) =46657a(25) =49141a(26) =52633a(27) =62745a(28) =65281a(29) =74665