a(n) = the smallest multiple of prime(n) such that a(n) == j-1 (mod j) for each integer j with 1 <= j < prime(n).

A234423

a(n) = the smallest multiple of prime(n) such that a(n) == j-1 (mod j) for each integer j with 1 <= j < prime(n).

Terms

    a(0) =2a(1) =3a(2) =35a(3) =119a(4) =2519a(5) =277199a(6) =5045039a(7) =183783599a(8) =4655851199a(9) =80313433199

External references