Least k > 0 such that t^k = 1 mod (prime(n) - t) for 0 < t < prime(n).

Terms

a(0) =1a(1) =1a(2) =2a(3) =4a(4) =6a(5) =60a(6) =60a(7) =120a(8) =144a(9) =7920a(10) =55440a(11) =18480a(12) =7920a(13) =27720a(14) =2520a(15) =637560a(16) =8288280a(17) =480720240a(18) =480720240a(19) =480720240a(20) =480720240a(21) =480720240a(22) =1442160720a(23) =9854764920a(24) =59128589520a(25) =59128589520a(26) =147821473800a(27) =670124014560