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 A093012 #22 Sep 08 2022 08:45:13
%S A093012 2,8,19,23,32,38,41,47,49,63,81,91,95,101,103,117,120,125,131,138,153,
%T A093012 161,182,188,193,195,208,225,232,241,248,256,262,266,272,280,292,300,
%U A093012 304,314,317,321,327,334,346,351,365,370,376,385,394,409,410,414,427
%N A093012 Numbers k such that prime(k) == 3 (mod 16).
%C A093012 A091968 indexed by A000040.
%C A093012 The asymptotic density of this sequence is 1/8 (by Dirichlet's theorem). - _Amiram Eldar_, Mar 01 2021
%H A093012 G. C. Greubel, <a href="/A093012/b093012.txt">Table of n, a(n) for n = 1..5000</a>
%F A093012 A000040(a(n)) = A091968(n).
%F A093012 a(n) = A000720(A091968(n)).
%t A093012 Select[Range[430], Mod[Prime[ # ], 16] == 3 &] (* _Ray Chandler_, Nov 06 2006 *)
%o A093012 (Magma) [n: n in [1..450]|(NthPrime(n) mod 16) eq 3] // _G. C. Greubel_, Feb 05 2019
%o A093012 (PARI) {isok(n) = Mod(prime(n), 16)==3};
%o A093012 for(n=1, 450, if(isok(n)==1, print1(n, ", "), 0)) \\ _G. C. Greubel_, Feb 05 2019
%Y A093012 Cf. A000040, A000720, A091968, A092022.
%K A093012 nonn
%O A093012 1,1
%A A093012 _Ray Chandler_, Mar 15 2004, revised Nov 06 2006