Primary pretenders: least composite c such that n^c == n (mod c).

Terms

a(0) =4a(1) =4a(2) =341a(3) =6a(4) =4a(5) =4a(6) =6a(7) =6a(8) =4a(9) =4a(10) =6a(11) =10a(12) =4a(13) =4a(14) =14a(15) =6a(16) =4a(17) =4a(18) =6a(19) =6a(20) =4a(21) =4a(22) =6a(23) =22a(24) =4a(25) =4a(26) =9a(27) =6a(28) =4a(29) =4