Let p_(3,1)(m) be the m-th prime == 1(mod 3). Then a(n) is the smallest p_(3,1)(m) such that the interval(p_(3,1)(m)*n, p_(3,1)(m+1)*n) contains exactly one prime == 1(mod 3).
A210465
Let p_(3,1)(m) be the m-th prime == 1(mod 3). Then a(n) is the smallest p_(3,1)(m) such that the interval(p_(3,1)(m)*n, p_(3,1)(m+1)*n) contains exactly one prime == 1(mod 3).
Terms
- a(0) =7a(1) =13a(2) =193a(3) =271a(4) =157a(5) =193a(6) =1297a(7) =1741a(8) =1231a(9) =1033a(10) =3541a(11) =1447a(12) =727a(13) =2341a(14) =9337a(15) =1747a(16) =9007a(17) =2287a(18) =3307a(19) =14401a(20) =8887a(21) =8161a(22) =8461a(23) =28753a(24) =23623a(25) =23893a(26) =10861a(27) =59233a(28) =70111a(29) =28927
External references
- oeis: A210465