Smallest (probable) prime of the form (2*k+1)^n-2, where k is 158.

For the smallest n such that (2*k+1)^n-2 is (probable) prime for k = 1, 2, 3, ..., this sequence is 2, 1, 1, 1, 4, 1, 1, 6, 1, 1, 24, 1, 2, 2, 1, 1, 2, 2, 1, 4, 1, 1, 2, 1, 8, 4, 1, 12, 4, 1, 1, 8, 3, 1, 2, 1, 1, 2, 38, 1, 4, 1, 4, 2, 1, 2, 4, 747, 1, 4, ...

To be completed...