14896902677domain: NAppears in sequencesSmallest 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).at n=12A246791