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 A160593 #11 Apr 13 2022 11:58:51 %S A160593 5,9,15,17,20,23,28,32,39,41,43,49,52,54,56,64,69,72,76,81,83,86,91, %T A160593 92,94,96,103,107,109,118,120,124,128,132,144,146,150,154,156,161,164, %U A160593 166,171,173,182,185,190,192,195,200,205,208,214,215,219,225,228,230,236 %N A160593 Indices of primes congruent to 11 modulo 12. %C A160593 The asymptotic density of this sequence is 1/4 (by Dirichlet's theorem). - _Amiram Eldar_, Mar 02 2021 %H A160593 Harvey P. Dale, <a href="/A160593/b160593.txt">Table of n, a(n) for n = 1..1000</a> %F A160593 a(n) = A000720(A068231(n)). %e A160593 a(1) = 5 since the 5th prime, A000040(5) = 11, is the first one to be equal to 11 (mod 12). %e A160593 a(2) = 9 since the 9th prime, A000040(9) = 23, is the second one to be equal to 11 (mod 12). %t A160593 Position[Mod[Prime[Range[250]],12],11]//Flatten (* _Harvey P. Dale_, Apr 13 2022 *) %o A160593 (PARI) for( n=1,999, prime(n)%12==11 & print1(n",")) %Y A160593 A116610 lists the even terms of this sequence, divided by 2. %Y A160593 Cf. A000720, A068231. %K A160593 nonn %O A160593 1,1 %A A160593 _M. F. Hasler_, May 22 2009