a(n) is the smallest b > 1 such that b^n - (b-1)^n has all divisors d == 1 (mod n).

Terms

a(0) =2a(1) =2a(2) =2a(3) =3a(4) =2a(5) =4a(6) =2a(7) =45a(8) =3a(9) =6a(10) =2a(11) =301a(12) =2a(13) =15a(14) =10a(15) =121a(16) =2a(17) =64a(18) =2a(19) =2101a(20) =7a(21) =12a(22) =2a(23) =1900081a(24) =6a(25) =27a(26) =18a(27) =225a(28) =2a(29) =9241