%I A127417
%S A127417 1,1,2,2,2,2,3,2,2,4,3,1,4,3,2,5,2,4,4,1,2,6,4,1,6,3,3,5,2,4,3,4,3,6,4,
%T A127417 2,3,5,5,4,3,3,7,2,2,7,4,3,5,3,4,5,6,3,3,4,2,6,6,4,6,4,5,3,3,5,5,3,3,7,
%U A127417 6,2,6,5,4,5,2,5,8,1,5,6,5,1,6,7,3,9,2,4,5,2,5,6,6,5,5,4,4,6,4,4,6,3,4
%N A127417 a(1)=1; for n > 1, a(n) = number of earlier terms a(k), 1<k<=n-1, such 
               that (a(k)+n) is divisible by k.
%C A127417 The value of a(1) = 1 is arbitrary. a(1) can be any integer and the rest 
               of the sequence would remain unchanged.
%H A127417 Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> 
               (listed in lieu of email address)
%e A127417 a(1)+11 = 12 is a multiple of 1; a(2)+11 = 12 is a multiple of 2; and 
               a(7)+11 = 14 is a multiple of 7. These 3 are the only cases where 
               (a(k)+11) is a multiple of k, for 1 <=k <=10. So a(11) = 3.
%t A127417 f[l_List] := Block[{n = Length[l] + 1},Append[l, Count[Table[Mod[l[[k]] 
               + n, k], {k, n - 1}], 0]]];Nest[f, {1}, 105] (*Chandler*)
%Y A127417 Cf. A127418.
%Y A127417 Sequence in context: A127992 A067595 A134868 this_sequence A128764 A074589 
               A165035
%Y A127417 Adjacent sequences: A127414 A127415 A127416 this_sequence A127418 A127419 
               A127420
%K A127417 nonn
%O A127417 1,3
%A A127417 Leroy Quet Jan 13 2007
%E A127417 Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jan 22 2007