|
Search: id:A135062
|
|
|
| A135062 |
|
Define the sequence {b_n(m)} by b_n(0)=1; b_n(m) = the number of positive divisors of (b_n(m-1)+n), for all m >= 1. Then a(n) is the smallest positive integer such that b_n(m) = b_n(m+a(n)) for all m > some positive integer. |
|
+0
2
|
|
| 1, 1, 2, 1, 1, 2, 1, 3, 2, 1, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
EXAMPLE
|
{b_8(m)} is 1,3,2,4,6,4,6,4,6,..., with (4,6) repeating thereafter. So a(8) = 2, the length of the repeating subsequence (4,6).
|
|
CROSSREFS
|
Cf. A135063.
Sequence in context: A050221 A113279 A034807 this_sequence A088428 A025838 A105248
Adjacent sequences: A135059 A135060 A135061 this_sequence A135063 A135064 A135065
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Nov 15 2007
|
|
|
Search completed in 0.002 seconds
|
