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 A155853 #18 Sep 08 2022 08:45:41
%S A155853 0,2,8,16,20,28,32,40,46,50,58,62,68,76,82,98,100,106,110,112,116,128,
%T A155853 130,140,146,152,160,166,170,172,188,190,196,208,218,232,250,256,266,
%U A155853 272,278,280,296,298,302,308,316,326,338,340,358,368,370,380,382,386
%N A155853 Numbers n such that 13*n + 3 is a prime.
%C A155853 From Avik Roy (avik_3.1416(AT)yahoo.co.in), Feb 02 2009: (Start)
%C A155853 Only numbers of the form 6m+-2 can be included in this sequence.
%C A155853 All terms are evidently even and thus it can be concluded that 13n+3 can't be a prime if n itself is a prime greater than 2. (End)
%H A155853 Vincenzo Librandi, <a href="/A155853/b155853.txt">Table of n, a(n) for n = 1..1000</a>
%t A155853 f[n_]:=13*n+3; lst={};Do[p=f[n];If[PrimeQ[p],AppendTo[lst,n]],{n,0,6!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Jul 01 2009 *)
%t A155853 Select[Range[0, 800],PrimeQ[13 # + 3] &] (* _Vincenzo Librandi_, Oct 15 2012 *)
%o A155853 (Magma) [n: n in [0..400] | IsPrime(13*n + 3)]; // _Vincenzo Librandi_, Oct 15 2012
%o A155853 (PARI) is(n)=isprime(13*n+3) \\ _Charles R Greathouse IV_, Aug 02 2018
%Y A155853 Cf. A100202 (associated primes), A155854.
%K A155853 nonn,easy
%O A155853 1,2
%A A155853 _Vincenzo Librandi_, Jan 29 2009
%E A155853 More terms from _Vladimir Joseph Stephan Orlovsky_, Jul 01 2009