cp's OEIS Frontend

A309056 Where records of A309036 occur.

%I A309056 #16 Apr 20 2020 05:35:16
%S A309056 1,4,25,26,43,77,201,336,881,2144,22305,24113,44349,48748,153884,
%T A309056 400161,793873,1195455,5066329,6227954,11394871,16233979,18368369,
%U A309056 63843903,80998288,117335658,246252769,6420049930,23198011949,30432298548,62709861290,117888644809
%N A309056 Where records of A309036 occur.
%C A309056 Numbers m such that A309036(m) > A309036(k) for all k < m.
%H A309056 Giovanni Resta, <a href="/A309056/b309056.txt">Table of n, a(n) for n = 1..37</a>
%F A309056 A309055(n) = A309036(a(n)).
%e A309056 a(3) = 25 is a term because A309036(25) = 20 and A309036(k) < 20 for k < 25.
%p A309056 S1:= 0: S2:= 0: Recn:= NULL: count:= 0:
%p A309056 maxv:= 0:
%p A309056 for n from 1 to 200000 do
%p A309056   p:= ithprime(n);
%p A309056   S1:= S1 + p;
%p A309056   S2:= S2 + n*p;
%p A309056   v:= igcd(S1, S2);
%p A309056   if v > maxv then
%p A309056     maxv:= v;
%p A309056     count:= count+1;
%p A309056     Recn:= Recn, n;
%p A309056   fi
%p A309056 od:
%p A309056 Recn;
%o A309056 (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(k, ", "))); } \\ _Jinyuan Wang_, Apr 16 2020
%Y A309056 Cf. A309036, A309055.
%K A309056 nonn
%O A309056 1,2
%A A309056 _Robert Israel_, Jul 09 2019
%E A309056 a(16)-a(27) from _Rémy Sigrist_, Jul 09 2019
%E A309056 a(28) from _Jinyuan Wang_, Apr 16 2020
%E A309056 Terms a(29) and beyond from _Giovanni Resta_, Apr 19 2020