|
|
A075046
|
|
a(n) = the smallest number k such that the number of divisors of the n numbers from k through k+n-1 are in nondescending order.
|
|
4
|
|
|
1, 1, 1, 1, 241, 241, 12853, 12853, 234613, 376741, 78312721, 125938261, 4019167441, 16586155153, 35237422882, 1296230533473, 42301168491121, 61118966262061
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
tau(k) <= tau(k+1) <= ... <= tau(k+n-1).
If a(n) > 1, then A013632(a(n)) >= n. Might be useful to help speed up brute force search. - Chai Wah Wu, May 04 2017
|
|
LINKS
|
|
|
EXAMPLE
|
a(5) = 241 = a(6) as tau(241) = 2 < tau(242) = tau(243) = tau(244) = tau(245) = 6 < tau(246).
|
|
MATHEMATICA
|
k = 1; Do[ While[t = Table[ DivisorSigma[0, i], {i, k, k + n - 1}]; t != Sort[t], k++ ]; Print[k], {n, 1, 11}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 19 2003
|
|
STATUS
|
approved
|
|
|
|