|
Search: id:A134834
|
|
|
| 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. |
|
+0
2
|
| |
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
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: A026338 A026242 A130526 this_sequence A035583 A145178 A105079
Adjacent sequences: A134831 A134832 A134833 this_sequence A134835 A134836 A134837
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Leroy Quet Nov 12 2007
|
|
|
Search completed in 0.002 seconds
|
