|
%I #9 Sep 13 2016 16:40:28
%S 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 6,4,0,113,109,103,101,91,89,83,77,73,67,61,59,49,47,43,41,29,17,13,
%U 11,7,1,240,230,224,218,212,210,204,200,198,188,174,170,168,164,150,144,134
%N a(n) = (a(n-1) + p(n)) mod p(n+1).
%C 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 Harvey P. Dale, <a href="/A082974/b082974.txt">Table of n, a(n) for n = 1..1000</a>
%e a(4)=(((2%3 + 3)%5 + 5)%7 + 7)%11 = (((2+3)%5+5)%7+7)%11
%e = (((0+5)%7+7)%11 = (5+7)%11 = 1
%t 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 (PARI) ps=0; pc=1; while (pc<100,ps+=prime(pc); ps%=prime(pc++); print1(ps","))
%Y Cf. A000040, A001223, A071089.
%K nonn
%O 1,1
%A _Jon Perry_, May 28 2003
%E Edited by _Henry Bottomley_, Jul 13 2003
%E Definition clarified by _Harvey P. Dale_, Sep 13 2016
|
