a(1)=1; thereafter a(n+1) is the least k > a(n) such that k is a square mod a(i) for all i<= n.

Terms

a(0) =1a(1) =2a(2) =3a(3) =4a(4) =9a(5) =13a(6) =16a(7) =25a(8) =36a(9) =49a(10) =64a(11) =81a(12) =100a(13) =121a(14) =144a(15) =169a(16) =196a(17) =225a(18) =256a(19) =289a(20) =324a(21) =361a(22) =400a(23) =441a(24) =484a(25) =529a(26) =576a(27) =625a(28) =676a(29) =729