Smallest number m such that for 0 <= k < n, np(m+k) = np(m)+k, where np(t) is number of primes p with prime(t) < p < prime(t)^(1 + 1/t).

A246791

Smallest number m such that for 0 <= k < n, np(m+k) = np(m)+k, where np(t) is number of primes p with prime(t) < p < prime(t)^(1 + 1/t).

Terms

    a(0) =1a(1) =4a(2) =15a(3) =136a(4) =2128a(5) =15453a(6) =479403a(7) =1184231a(8) =10975072a(9) =27112368a(10) =175600366a(11) =2304656281a(12) =14896902677a(13) =59331462112

External references