a(n) = smallest integer k such that k*prime(n) == 1 mod j for each integer j with 1<j<prime(n).
A099794
a(n) = smallest integer k such that k*prime(n) == 1 mod j for each integer j with 1<j<prime(n).
Terms
- a(0) =1a(1) =1a(2) =5a(3) =43a(4) =2291a(5) =6397a(6) =423953a(7) =2579419a(8) =30364247a(9) =77544004469
External references
- oeis: A099794