10152454583
domain: N
Appears in sequences
- a(n) = smallest positive integer x satisfying the system of congruences { x == 1 (mod 2), x == 2 (mod 3), x == 3 (mod 5), x == 5 (mod 7), ..., x == A008578(n) (mod A008578(n+1)) }.at n=10A116151
- Smallest positive integer m such that m == prime(i) (mod prime(i+1)) for all 1<=i<=n.at n=9A157752
- a(n) is the least prime == prime(i-1) (mod prime(i)) for 2 <= i <= n.at n=8A352355
- a(n) is the least prime == prime(i-1) (mod prime(i)) for 2 <= i <= n.at n=9A352355