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

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, 101, 71, 116, 71, 127, 74, 137, 79, 148, 87, 163, 102, 189, 135, 204, 175, 211, 214, 249, 238, 257, 260, 277, 292, 319, 305, 364, 351, 391, 357, 412, 370, 434, 391, 465, 429

Offset: 0

Author

Leroy Quet, Jan 30 2007

Keywords

• easy
• nonn

Links

• Ivan Neretin, Table of n, a(n) for n = 0..10000

Crossrefs

Cf. A096535.

Programs

Mathematica

f[l_List] := Append[l, l[[ -2]] + Mod[l[[ -1]], Length[l]]];Nest[f, {1, 1}, 63] (* Ray Chandler, Feb 08 2007 *)

Extensions

Extended by Ray Chandler, Feb 08 2007