|
| |
|
|
A140225
|
|
a(n) = number of m's among (d(1),d(2),...,d(n)), where m is the maximum value of (d(1),d(2),...,d(n)) and d(n) is the number of divisors of n.
|
|
2
| |
|
|
1, 1, 2, 1, 1, 1, 1, 2, 2, 3, 3, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
EXAMPLE
| The sequence of the numbers of divisors of the first 11 positive integers is: 1,2,2,3,2,4,2,4,3,4,2.
The maximum value obtained here is 4. There are three 4's among (d(1), d(2),...,d(11)); so a(11)=3.
|
|
|
MATHEMATICA
| a = {}; b = {}; For[n = 1, n < 80, n++, AppendTo[b, Length[Divisors[n]]]; AppendTo[a, Length[Select[b, # == Max[b] &]]]]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), May 18 2008
|
|
|
CROSSREFS
| Cf. A000005, A140223, A140224.
Sequence in context: A025876 A109035 A064823 * A104758 A143227 A026791
Adjacent sequences: A140222 A140223 A140224 * A140226 A140227 A140228
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Leroy Quet, May 12 2008
|
|
|
EXTENSIONS
| More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), May 18 2008
a(78)-a(105) from Ray Chandler (rayjchandler(AT)sbcglobal.net), Jun 26 2009
|
| |
|
|
