A272181 a(1) = 1; a(n) = n mod a(k), k being the largest value such that n mod a(k) > 1, or n if there is no such k.

1, 2, 3, 2, 2, 6, 7, 2, 2, 3, 2, 5, 3, 2, 3, 2, 2, 3, 4, 2, 3, 2, 2, 4, 4, 2, 3, 3, 2, 2, 3, 2, 3, 2, 2, 36, 2, 2, 3, 4, 2, 2, 3, 2, 9, 2, 2, 3, 4, 2, 3, 7, 4, 2, 3, 2, 3, 2, 2, 4, 5, 2, 3, 4, 2, 2, 3, 2, 4, 2, 3, 2, 3, 2

Offset: 1

Author

Cody M. Haderlie, Apr 21 2016

Keywords

• nonn

Examples

			a(5) = 2; k = 3 and 5 mod a(3) = 2.
		

Links

• Cody M. Haderlie, Table of n, a(n) for n = 1..100000