%I A134834
%S A134834 2,3,2,4,3,8,2,3,4,6
%N A134834 Let {b_n(m)} be a sequence defined by b_n(0)=1, b_n(m) = the largest 
               prime dividing (b_n(m-1) +n). Then a(n) is the smallest positive 
               integer such that b_n(m+a(n)) = b_n(m), for all integers m that are 
               greater than some positive integer M.
%H A134834 Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> 
               (listed in lieu of email address)
%e A134834 Sequence {b_9(m)} is 1,5,7,2,11,5,7,2,11,... (5,7,2,11) repeats. So a(9) 
               = 4, the length of the cycle in {b_9(m)}.
%Y A134834 Cf. A134835.
%Y A134834 Sequence in context: A026338 A026242 A130526 this_sequence A035583 A145178 
               A105079
%Y A134834 Adjacent sequences: A134831 A134832 A134833 this_sequence A134835 A134836 
               A134837
%K A134834 more,nonn
%O A134834 1,1
%A A134834 Leroy Quet Nov 12 2007