Let p_(3,2)(m) be the m-th prime == 2(mod 3). Then a(n) is the smallest p_(3,2)(m) such that the interval(p_(3,2)(m)*n, p_(3,2)(m+1)*n) contains exactly one prime == 2 (mod 3).

A210467

Let p_(3,2)(m) be the m-th prime == 2(mod 3). Then a(n) is the smallest p_(3,2)(m) such that the interval(p_(3,2)(m)*n, p_(3,2)(m+1)*n) contains exactly one prime == 2 (mod 3).

Terms

    a(0) =2a(1) =2a(2) =101a(3) =263a(4) =1097a(5) =251a(6) =311a(7) =461a(8) =641a(9) =941a(10) =1601a(11) =2351a(12) =2543a(13) =5003a(14) =2837a(15) =4787a(16) =5711a(17) =4283a(18) =7901a(19) =10331a(20) =8831a(21) =2687a(22) =7877a(23) =54287a(24) =5711a(25) =5501a(26) =5303a(27) =56087a(28) =69827a(29) =15641

External references