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 A147603 #2 Mar 30 2012 17:26:28
%S A147603 7,13,17,19,31,41,43,61,71,73,79,83,97,103,107,109,127,131,139,151,
%T A147603 167,181,193,197,199,211,227,229,241,251,271,277,281,283,307,311,313,
%U A147603 331,347,349,367,383,397,409,419,421,433,443,457,463,467,487,499,503,523
%N A147603 Primes congruent to (1,1,2) mod 3, see comment.
%C A147603 Primes in increasing order such that, for k=0,1,2,...:
%C A147603 a(3k+1) = primes congruent to 1 mod 3,
%C A147603 a(3k+2) = primes congruent to 1 mod 3,
%C A147603 a(3k+3) = primes congruent to 2 mod 3.
%C A147603 Prime analog to A147534 Numbers congruent to (1,1,2) mod 3.
%t A147603 s={};n3=1;Do[Do[If[Mod[p=Prime[n],3]==1,AppendTo[s,p];n1=n+1;Break[]],{n,n3,1000}]; Do[If[Mod[p=Prime[n],3]==1,AppendTo[s,p];n2=n+1;Break[]],{n,n1,1000}]; Do[If[Mod[p=Prime[n],3]==2,AppendTo[s,p];n3=n+1;Break[]],{n,n2,1000}],{55}];s
%Y A147603 A147534
%K A147603 nonn
%O A147603 1,1
%A A147603 _Zak Seidov_, Nov 08 2008