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 A309055 #16 Apr 20 2020 05:35:31 %S A309055 2,17,20,43,107,142,176,1291,1748,3309,5114,9412,13032,53799,62195, %T A309055 258834,515752,590919,1880056,4387977,4982469,8725487,10021836, %U A309055 22701799,34769113,75672055,3847032954,6476460401,8607624876,13054048917,40404144055,55300901872 %N A309055 Record values of A309036. %H A309055 Giovanni Resta, <a href="/A309055/b309055.txt">Table of n, a(n) for n = 1..37</a> %F A309055 a(n) = A309036(A309056(n)). %e A309055 a(3) = 20 is a term because A309036(25) = 20 and A309036(k) < 20 for k < 25. %p A309055 S1:= 0: S2:= 0: Recv:= NULL: count:= 0: %p A309055 maxv:= 0: %p A309055 for n from 1 to 200000 do %p A309055 p:= ithprime(n); %p A309055 S1:= S1 + p; %p A309055 S2:= S2 + n*p; %p A309055 v:= igcd(S1, S2); %p A309055 if v > maxv then %p A309055 maxv:= v; %p A309055 count:= count+1; %p A309055 Recv:= Recv,v; %p A309055 fi %p A309055 od: %p A309055 Recv; %o A309055 (PARI) lista(nn) = {my(k=r=s=t=0); forprime(p=2, nn, if(gcd(s+=p, t+=(k++)*p)>r, r=gcd(s,t); print1(r, ", "))); } \\ _Jinyuan Wang_, Apr 16 2020 %Y A309055 Cf. A309036, A309056. %K A309055 nonn %O A309055 1,1 %A A309055 _Robert Israel_, Jul 09 2019 %E A309055 a(16)-a(27) from _Rémy Sigrist_, Jul 09 2019 %E A309055 a(28) from _Jinyuan Wang_, Apr 16 2020 %E A309055 Terms a(29) and beyond from _Giovanni Resta_, Apr 19 2020