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 A303093 #14 Apr 09 2022 08:39:00 %S A303093 53,173,263,373,563,593,653,733,1103,1123,1223,1753,2903,2963,3313, %T A303093 3733,4013,4993,5113,5303,5393,5563,6073,6263,6323,6373,6863,7523, %U A303093 7583,7823,8713,9473,10253,10853,11903,11933,12583,12653,12973,13043,13463,14543,14753 %N A303093 Balanced primes of order one ending in 3. %H A303093 Harvey P. Dale, <a href="/A303093/b303093.txt">Table of n, a(n) for n = 1..1000</a> %e A303093 53 = (47 + 53 + 59)/3 = 159/3 and 53 = 5*10 + 3. %p A303093 p:=ithprime: a:=n->`if`(add(p(n-k),k=-1..1)=3*p(n) and modp(p(n), 10) = 3,p(n),NULL): seq(a(n),n=3..2000); %t A303093 Select[Partition[Prime[Range[2000]],3,1],Mean[#]==#[[2]]&&Mod[#[[2]],10]==3&][[All, 2]] (* _Harvey P. Dale_, Apr 09 2022 *) %o A303093 (GAP) P:=Filtered([1..15000],IsPrime);; %o A303093 a:=Filtered(List(Filtered(List([0..Length(P)-3],k->List([1..3],j->P[j+k])),i->Sum(i)/3=i[2]),m->m[2]),l-> l mod 10=3); %Y A303093 Intersection of A006562 and A030431. %Y A303093 Cf. A303092, A303094, A303095. %K A303093 nonn,base %O A303093 1,1 %A A303093 _Muniru A Asiru_, Apr 18 2018