a(0) = 1; a(n) is the smallest integer k > a(n-1) such that 3^(k-1) == 1 (mod a(n-1)*k).

Terms

a(0) =1a(1) =2a(2) =5a(3) =13a(4) =19a(5) =37a(6) =73a(7) =97a(8) =193a(9) =241a(10) =601a(11) =751a(12) =2251a(13) =3001a(14) =4001a(15) =16001a(16) =96001a(17) =160001a(18) =1120001a(19) =4480001a(20) =13440001a(21) =20160001a(22) =23385601a(23) =29232001a(24) =36540001a(25) =38628001a(26) =115884001a(27) =231768001a(28) =579420001a(29) =1448550001