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

%I #10 Jun 18 2018 15:08:59

%S 0,1,1,2,3,5,8,6,14,11,15,15,18,20,24,29,37,32,51,45,56,59,71,61,84,

%T 70,102,91,109,113,132,121,157,146,167,173,196,184,228,217,245,257,

%U 250,292,278,300,302,320,334,360,344,398,378,405,405,425,438,464,438

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

%H Ivan Neretin, <a href="/A182445/b182445.txt">Table of n, a(n) for n = 0..10000</a>

%t Fold[Append[#1, Mod[#1[[-1]], #2] + #1[[-2]]] &, {0, 1}, Range[2, 58]] (* _Ivan Neretin_, Jun 18 2018 *)

%o (Python)

%o prpr = 0

%o prev = 1

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

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

%o . print prpr,

%o . prpr = prev

%o . prev = current

%Y Cf. A182444.

%K nonn

%O 0,4

%A _Alex Ratushnyak_, Apr 29 2012