|
Search: id:A075046
|
|
|
| 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 (nonstrictly) ascending order. |
|
+0
2
|
|
| 1, 1, 1, 1, 241, 241, 12853, 12853, 234613, 376741, 78312721
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
tau(k) <= tau(k+1) <= ... <= tau(k+n-1).
|
|
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
|
Cf. A075028, A075029, A075031, A075041, A045983, A006073, A075044, A055927, A075047.
Sequence in context: A008696 A047806 A028678 this_sequence A050968 A142918 A139502
Adjacent sequences: A075043 A075044 A075045 this_sequence A075047 A075048 A075049
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 03 2002
|
|
EXTENSIONS
|
More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 19 2003
a(11) from Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 07 2003
|
|
|
Search completed in 0.002 seconds
|
