a(n) is the least k such that there are exactly n primes between prime(k) + 1 and floor(prime(k + 1)^2/prime(k)) (inclusive) or 0 if no such k exists.

A344582

a(n) is the least k such that there are exactly n primes between prime(k) + 1 and floor(prime(k + 1)^2/prime(k)) (inclusive) or 0 if no such k exists.

Terms

    a(0) =1a(1) =2a(2) =4a(3) =30a(4) =180a(5) =462a(6) =890a(7) =1532a(8) =3385a(9) =19871a(10) =29040a(11) =59257a(12) =66762a(13) =31545a(14) =597311a(15) =1448751a(16) =1421021a(17) =1293698a(18) =12768473a(19) =2279181a(20) =147165284a(21) =118374763a(22) =821495413a(23) =2618883054a(24) =2247521689a(25) =3145845927a(26) =7650216016a(27) =27357920380a(28) =22859974504a(29) =189924891289

External references