A246792 - cp's OEIS frontend

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

n	a(n)
1	1
2	7
3	25
4	25
5	181
6	208
7	208
8	1867
9	14345
10	19609
11	40918
12	40918
13	620326
14	2552265
15	2552265
16	7225612
17	7225612
18	16679492
19	33772734
20	33772734
21	33772734
22	620326386
23	1516416904
24	1516416904
25	4764006481
26	5272314878
27	21423652192

[1, 7, 25, 25, 181, 208, 208, 1867, 14345, 19609, 40918, 40918, 620326, 2552265, 2552265, 7225612, 7225612, 16679492, 33772734, 33772734, 33772734, 620326386, 1516416904, 1516416904, 4764006481, 5272314878, 21423652192]

cp's OEIS Frontend

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

Table of values

List of values