%I #12 Oct 10 2019 15:55:45
%S 1,1,2,3,5,3,8,4,12,7,19,15,22,24,32,26,42,34,58,35,73,45,74,50,76,51,
%T 101,71,116,71,127,74,137,79,148,87,163,102,189,135,204,175,211,214,
%U 249,238,257,260,277,292,319,305,364,351,391,357,412,370,434,391,465,429
%N a(0) = a(1) = 1; for n>1, a(n) = a(n-2) + a(n-1) (mod n).
%H Ivan Neretin, <a href="/A125677/b125677.txt">Table of n, a(n) for n = 0..10000</a>
%t f[l_List] := Append[l, l[[ -2]] + Mod[l[[ -1]], Length[l]]];Nest[f, {1, 1}, 63] (* _Ray Chandler_, Feb 08 2007 *)
%Y Cf. A096535.
%K easy,nonn
%O 0,3
%A _Leroy Quet_, Jan 30 2007
%E Extended by _Ray Chandler_, Feb 08 2007