The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 1
 2, 3, 2, 4, 3, 8, 2, 3, 4, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS EXAMPLE 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)}. CROSSREFS Cf. A134835. Sequence in context: A130526 A174523 A261172 * A035583 A145178 A105079 Adjacent sequences:  A134831 A134832 A134833 * A134835 A134836 A134837 KEYWORD more,nonn AUTHOR Leroy Quet, Nov 12 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 14 07:59 EDT 2021. Contains 342946 sequences. (Running on oeis4.)