|
Search: id:A134835
|
|
|
| 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. |
|
+0
2
|
|
| 1, 1, 4, 1, 1, 1, 3, 1, 1, 1, 6, 1
(list; graph; listen)
|
|
|
OFFSET
|
2,3
|
|
|
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.
Adjacent sequences: A134832 A134833 A134834 this_sequence A134836 A134837 A134838
Sequence in context: A132157 A103163 A010327 this_sequence A031278 A010328 A085731
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Nov 12 2007
|
|
|
Search completed in 0.002 seconds
|
