This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A167134 #9 Apr 29 2025 13:37:44
%S A167134 2,3,5,7,13,29,47,71,73,79,101,113,137,139,157,167,179,181,211,223,
%T A167134 227,233,269,271,277,293,311,313,337,359,379,401,409,421,431,443,467,
%U A167134 487,491,509,541,557,563,577,599,601,607,619,641,643,673,709,733,739,751
%N A167134 Primes congruent to {2, 3, 5, 7} mod 11.
%C A167134 Primes p such that p mod 11 is prime.
%C A167134 Primes of the form 11*n+r where n >= 0 and r is in {2, 3, 5, 7}.
%C A167134 2 and primes congruent to {3, 5, 7, 13} mod 22. - _Chai Wah Wu_, Apr 29 2025
%H A167134 Vincenzo Librandi, <a href="/A167134/b167134.txt">Table of n, a(n) for n = 1..1000</a>
%t A167134 Select[Prime[Range[600]],MemberQ[{2, 3, 5, 7},Mod[#,11]]&] (* _Vincenzo Librandi_, Aug 05 2012 *)
%o A167134 (Magma) [ p: p in PrimesUpTo(760) | p mod 11 in {2, 3, 5, 7} ];
%o A167134 [ p: p in PrimesUpTo(760) | exists(t){ n: n in [0..p div 11] | exists(u){ r: r in {2, 3, 5,7} | p eq (11*n+r) } } ];
%Y A167134 Cf. A003627, A045326, A003631, A045309, A045314, A042987, A078403, A042993, A167134, A167135, A167119: primes p such that p mod k is prime, for k = 3..13 resp.
%K A167134 nonn,easy
%O A167134 1,1
%A A167134 _Klaus Brockhaus_, Oct 28 2009