login
a(0)=0, a(1)=1, for n>1, a(n) = a(n-1) + (a(n-2) mod n).
3

%I #12 May 30 2020 15:21:07

%S 0,1,1,2,3,5,8,13,13,17,20,26,34,34,40,44,52,62,78,83,101,121,134,140,

%T 154,169,193,200,225,251,266,269,279,284,291,295,298,334,366,388,394,

%U 413,429,455,488,493,521,544,585,590,625,654,655,673,680,693

%N a(0)=0, a(1)=1, for n>1, a(n) = a(n-1) + (a(n-2) mod n).

%H Harvey P. Dale, <a href="/A182444/b182444.txt">Table of n, a(n) for n = 0..1000</a>

%t nxt[{n_,a_,b_}]:={n+1,b,b+Mod[a,n+1]}; NestList[nxt,{1,0,1},60][[All,2]] (* _Harvey P. Dale_, May 30 2020 *)

%o (Python)

%o prpr = 0

%o prev = 1

%o for i in range(2,99):

%o . current = prev + (prpr % i)

%o . print prpr,

%o . prpr = prev

%o . prev = current

%Y Cf. A182445.

%K nonn

%O 0,4

%A _Alex Ratushnyak_, Apr 29 2012