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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A134835 Let {b_n(m)} be a sequence defined by b_n(0)=0, 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
1, 1, 4, 1, 1, 1, 3, 1, 1, 1, 6, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,3

LINKS

Table of n, a(n) for n=2..13.

EXAMPLE

Sequence {b_8(m)} is 0,2,5,13,7,5,13,7,...(5,13,7) repeats. So a(8) = 3, the length of the cycle in {b_8(m)}.

CROSSREFS

Cf. A134834.

Sequence in context: A128211 A199393 A010327 * A321592 A031278 A010328

Adjacent sequences:  A134832 A134833 A134834 * A134836 A134837 A134838

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 6 14:16 EDT 2021. Contains 343586 sequences. (Running on oeis4.)