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 A024707 #12 Jul 06 2014 23:50:33
%S A024707 5,8,10,11,13,17,18,20,22,24,26,29,32,34,35,36,41,42,43,46,47,50,52,
%T A024707 53,54,57,58,60,64,67,70,72,75,77,79,80,81,82,83,85,87,89,92,94,95,97,
%U A024707 98,100,104,105,109,110,114,115,116,120,121,125,126,127,128,131,133,135,136,140,141
%N A024707 Positions of multiples of 5 in A024702.
%H A024707 Charles R Greathouse IV, <a href="/A024707/b024707.txt">Table of n, a(n) for n = 1..10000</a>
%F A024707 Numbers n such that ((prime(n) mod 5) mod 3) = 1; e.g., prime(10) = 29, (29 mod 5) = 4, and (4 mod 3) = 1. _Clark Kimberling_, Jul 05 2014
%p A024707 A024707:=n->`if`((ithprime(n) mod 5) mod 3 = 1, n, NULL): seq(A024707(n), n=1..150); # _Wesley Ivan Hurt_, Jul 06 2014
%t A024707 z = 300; u = Mod[Table[Mod[Prime[n], 5], {n, 1, z}], 3] (* A244738 *)
%t A024707 v1 = Flatten[Position[u, 0]] (* A244739 *)
%t A024707 v2 = Flatten[Position[u, 1]] (* A024707 *)
%t A024707 v3 = Flatten[Position[u, 2]] (* A244741 *) (* _Clark Kimberling_ , Jul 05 2014 *)
%o A024707 (PARI) apply(n->primepi(n), select(n->n%9==1||n%9==8, primes(100))) \\ _Charles R Greathouse IV_, May 31 2013
%Y A024707 Cf. A244738, A244739, A244741.
%K A024707 nonn
%O A024707 1,1
%A A024707 _Clark Kimberling_