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 A269705 #19 Sep 08 2022 08:46:16 %S A269705 8,12,21,29,31,38,42,46,58,63,75,78,84,93,99,100,106,112,115,131,134, %T A269705 141,145,153,157,159,167,169,179,187,191,193,207,211,224,232,242,244, %U A269705 247,257,260,264,272,276,279,287,303,306,310,316,324,326,327,335,337 %N A269705 Numbers k such that prime(k) == 1 (mod 9). %C A269705 The asymptotic density of this sequence is 1/6 (by Dirichlet's theorem). - _Amiram Eldar_, Mar 02 2021 %e A269705 a(1) = 8 because prime(8) = 19 and 19 == 1 (mod 9). %t A269705 Select[Range[400], Mod[Prime[#], 9] == 1 &] %o A269705 (Magma) [n: n in [1..500] | NthPrime(n) mod 9 eq 1]; %o A269705 (PARI) lista(nn) = for(n=1, nn, if(Mod(prime(n),9)==1, print1(n, ", "))); \\ _Altug Alkan_, Mar 04 2016 %Y A269705 The associated primes are in A061237. %Y A269705 Cf. similar sequences listed in A269703. %K A269705 nonn %O A269705 1,1 %A A269705 _Vincenzo Librandi_, Mar 04 2016