cp's OEIS Frontend

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

%I A182445 #14 Apr 15 2025 14:42:52
%S A182445 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 A182445 70,102,91,109,113,132,121,157,146,167,173,196,184,228,217,245,257,
%U A182445 250,292,278,300,302,320,334,360,344,398,378,405,405,425,438,464,438
%N A182445 a(0)=0, a(1)=1, for n>1, a(n) = a(n-2) + (a(n-1) mod n).
%H A182445 Ivan Neretin, <a href="/A182445/b182445.txt">Table of n, a(n) for n = 0..10000</a>
%t A182445 Fold[Append[#1, Mod[#1[[-1]], #2] + #1[[-2]]] &, {0, 1}, Range[2, 58]] (* _Ivan Neretin_, Jun 18 2018 *)
%o A182445 (Python)
%o A182445 prpr = 0
%o A182445 prev = 1
%o A182445 for i in range(2,99):
%o A182445     current = prpr + (prev % i)
%o A182445     print(prpr, end=', ')
%o A182445     prpr = prev
%o A182445     prev = current
%Y A182445 Cf. A182444.
%K A182445 nonn
%O A182445 0,4
%A A182445 _Alex Ratushnyak_, Apr 29 2012