The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

A087371

Smallest k such that 10^k + 2n-1 is a prime >10, or 0 if no such k exists. Index of the smallest power of 10 which when increased by the n-th odd number yields a prime.

Most of the terms are 0, 1 or 2. Subsidiary sequence: Index of the first occurrence of n. Conjecture: There exists a finite M such that a(n) < M for all n.