|
%I #11 Apr 27 2016 23:55:37
%S 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,
%T 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,
%U 4,2,3,2,3,2
%N 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.
%H Cody M. Haderlie, <a href="/A272181/b272181.txt">Table of n, a(n) for n = 1..100000</a>
%e a(5) = 2; k = 3 and 5 mod a(3) = 2.
%K nonn
%O 1,2
%A _Cody M. Haderlie_, Apr 21 2016
|
