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 A163595 #21 Mar 02 2021 06:00:43
%S A163595 3,9,13,17,30,32,35,39,52,55,62,64,69,76,79,81,94,97,103,109,113,119,
%T A163595 132,135,139,154,160,165,170,173,176,185,196,201,208,212,215,220,223,
%U A163595 225,234,239,245,248,253,265,270,277
%N A163595 Numbers k such that prime(k) == 5 (mod 9).
%C A163595 The asymptotic density of this sequence is 1/6 (by Dirichlet's theorem). - _Amiram Eldar_, Mar 02 2021
%H A163595 G. C. Greubel, <a href="/A163595/b163595.txt">Table of n, a(n) for n = 1..5000</a>
%F A163595 A000040(a(n)) = A061240(n).
%F A163595 a(n) = A000720(A061240(n)).
%p A163595 for n from 1 to 300 do p := ithprime(n) ; if (p mod 9 ) = 5 then printf("%d,",n) ; fi; od: # _R. J. Mathar_, Aug 01 2009
%p A163595 A163595 := proc(n) option remember ; local a; if n = 1 then 3 ; else for a from procname(n-1)+1 do if ithprime(a) mod 9 = 5 then return(a) ; fi; end do: end if; end proc: seq(A163595(n),n=1..100) ; # _R. J. Mathar_, Oct 10 2009
%t A163595 Select[Range[300],Mod[Prime[#],9]==5&] (* _Harvey P. Dale_, Apr 25 2011 *)
%Y A163595 Cf. A000040, A000720, A061240, A093012.
%K A163595 nonn
%O A163595 1,1
%A A163595 _Juri-Stepan Gerasimov_, Aug 01 2009