197468

Appears in sequences

• Smallest positive integer m such that m == prime(i) (mod prime(i+1)) for all 1<=i<=n.at n=5A157752
• Array T(n,k) = least integer congruent to prime(i) mod prime(i+1) for all k <= i <= k+n; n, k >= 1; read by upward diagonals.at n=15A268491