423953

Appears in sequences

• a(n) = smallest integer k such that k*prime(n) == 1 mod j for each integer j with 1<j<prime(n).at n=6A099794
• a(n) = smallest nonnegative integer solution z to the system of congruences: z == 0 (mod n), z == 1 (mod A038610(n)) if n is in A033948; or z == 0 (mod n), z == -1 (mod A038610(n)) if n is in A033949.at n=16A255979