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

A210476

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

Terms

    a(0) =7a(1) =67a(2) =43a(3) =67a(4) =67a(5) =191a(6) =883a(7) =43a(8) =643a(9) =379a(10) =739a(11) =103a(12) =463a(13) =643a(14) =487a(15) =883a(16) =1303a(17) =3847a(18) =1447a(19) =13963a(20) =1087a(21) =8863a(22) =1999a(23) =8167a(24) =7687a(25) =8443a(26) =2707a(27) =2203a(28) =11083a(29) =3463

External references