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 A082974 #12 Aug 23 2024 23:22:01
%S A082974 2,0,5,1,12,8,6,2,25,23,17,13,11,7,1,54,52,46,42,40,34,30,24,16,12,10,
%T A082974 6,4,0,113,109,103,101,91,89,83,77,73,67,61,59,49,47,43,41,29,17,13,
%U A082974 11,7,1,240,230,224,218,212,210,204,200,198,188,174,170,168,164,150,144,134
%N A082974 a(n) = (a(n-1) + p(n)) mod p(n+1).
%C A082974 Differences when decreasing are essentially A001223, so increases occur when primes being used are roughly double those at previous increase; e.g. a(3352)=(12+31123)mod 31139=31135 and a(6257)=(1+62273)mod 62297=62274 - _Henry Bottomley_, Jul 13 2003
%H A082974 Harvey P. Dale, <a href="/A082974/b082974.txt">Table of n, a(n) for n = 1..1000</a>
%e A082974 a(2) = (a(1) + 3) mod 5 = 5 mod 5 = 0.
%e A082974 a(3) = (a(2) + 5) mod 7 = 5 mod 7 = 5.
%e A082974 a(4) = (a(3) + 7) mod 11 = 12 mod 11 = 1.
%t A082974 nxt[{n_,a_}]:={n+1,Mod[a+Prime[n+1],Prime[n+2]]}; NestList[nxt,{1,2},70][[All,2]] (* _Harvey P. Dale_, Sep 13 2016 *)
%o A082974 (PARI) ps=0; pc=1; while (pc<100,ps+=prime(pc); ps%=prime(pc++); print1(ps","))
%Y A082974 Cf. A000040, A001223, A071089.
%K A082974 nonn,easy
%O A082974 1,1
%A A082974 _Jon Perry_, May 28 2003
%E A082974 Edited by _Henry Bottomley_, Jul 13 2003
%E A082974 Definition clarified by _Harvey P. Dale_, Sep 13 2016