cp's OEIS Frontend

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

%I A182444 #16 Apr 15 2025 14:59:17
%S A182444 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 A182444 154,169,193,200,225,251,266,269,279,284,291,295,298,334,366,388,394,
%U A182444 413,429,455,488,493,521,544,585,590,625,654,655,673,680,693
%N A182444 a(0)=0, a(1)=1, for n>1, a(n) = a(n-1) + (a(n-2) mod n).
%H A182444 Harvey P. Dale, <a href="/A182444/b182444.txt">Table of n, a(n) for n = 0..1000</a>
%t A182444 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 A182444 (Python)
%o A182444 prpr = 0
%o A182444 prev = 1
%o A182444 for i in range(2,99):
%o A182444     current = prev + (prpr % i)
%o A182444     print(prpr, end=', ')
%o A182444     prpr = prev
%o A182444     prev = current
%Y A182444 Cf. A182445.
%K A182444 nonn
%O A182444 0,4
%A A182444 _Alex Ratushnyak_, Apr 29 2012