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

Terms

a(0) =1a(1) =3a(2) =5a(3) =13a(4) =37a(5) =73a(6) =109a(7) =181a(8) =541a(9) =1621a(10) =4861a(11) =9721a(12) =10531a(13) =17551a(14) =29251a(15) =87751a(16) =526501a(17) =3159001a(18) =5528251a(19) =11056501a(20) =44226001a(21) =49385701a(22) =98771401a(23) =172849951a(24) =345699901a(25) =352755001a(26) =564408001a(27) =634959001a(28) =793698751a(29) =793886887