77544004469
domain: N
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=9A099794
- A038610(n) (the LCM of the positive integers that are <= n and are coprime to n) is the a(n)-th positive integer that is coprime to n.at n=28A137450
- 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=28A255979