a(n) is the smallest nonzero number k such that gcd(prime(1)^k + 1, prime(2)^k + 1, ..., prime(n)^k + 1) > 1 and gcd(prime(1)^k + 1, prime(2)^k + 1, ..., prime(n+1)^k + 1) = 1.

A351921

a(n) is the smallest nonzero number k such that gcd(prime(1)^k + 1, prime(2)^k + 1, ..., prime(n)^k + 1) > 1 and gcd(prime(1)^k + 1, prime(2)^k + 1, ..., prime(n+1)^k + 1) = 1.

Terms

    a(0) =2a(1) =26a(2) =21a(3) =86a(4) =33a(5) =1238a(6) =4401a(7) =4586a(8) =16161a(9) =18561a(10) =81a(11) =37046a(12) =85478a(13) =180146a(14) =339866

External references