47350

Appears in sequences

• a(n) = least solution k of f(k) = f(k-1) + ... + f(k-n), where f(m) = prime(m+1)-prime(m) and prime(m) denotes the m-th prime, if k exists; 0 otherwise.at n=10A066496
• Largest k such that round(1/(sqrt(prime(k+1))-sqrt(prime(k)))) = n where prime(n) denotes the n-th prime (conjectured values).at n=16A078693
• Position of second appearance of 2n in the sequence of prime gaps A001223; if 2n does not appear at least twice, a(n) = -1.at n=44A356221