Euler pseudoprimes: composite numbers n such that 2^((n-1)/2) == +-1 (mod n).

Terms

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