a(n) is the smallest m such that d(m+k-1) = 2k for k = 1, ..., n where d(t)= prime(t+1) - prime(t) (differences of consecutive primes in arithmetic progression).

A090870

a(n) is the smallest m such that d(m+k-1) = 2k for k = 1, ..., n where d(t)= prime(t+1) - prime(t) (differences of consecutive primes in arithmetic progression).

Terms

    a(0) =2a(1) =3a(2) =7a(3) =69a(4) =1642a(5) =12073a(6) =12073a(7) =6496152a(8) =118033638a(9) =5575956036a(10) =165534366186

External references