|
Search: id:A135063
|
|
|
| A135063 |
|
Define the sequence {b_n(m)} by b_n(0)=0; 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, 2, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
EXAMPLE
|
{b_7(m)} is 0,2,3,4,2,3,4,..., with (2,3,4) repeating thereafter. So a(7) = 3, the length of the repeating subsequence (2,3,4).
|
|
CROSSREFS
|
Cf. A135062.
Sequence in context: A076933 A071974 A056622 this_sequence A129265 A030358 A118914
Adjacent sequences: A135060 A135061 A135062 this_sequence A135064 A135065 A135066
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Leroy Quet, Nov 15 2007
|
|
|
Search completed in 0.002 seconds
|
