The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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

%I

%S 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,

%T 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,

%U 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

%N 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.

%e 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.

%e The maximum value obtained here is 4. There are three 4's among (d(1), d(2),...,d(11)); so a(11)=3.

%t a = {}; b = {}; For[n = 1, n < 80, n++, AppendTo[b, Length[Divisors[n]]]; AppendTo[a, Length[Select[b, # == Max[b] &]]]]; a (* _Stefan Steinerberger_, May 18 2008 *)

%Y Cf. A000005, A140223, A140224.

%K nonn

%O 1,3

%A _Leroy Quet_, May 12 2008

%E More terms from _Stefan Steinerberger_, May 18 2008

%E a(78)-a(105) from _Ray Chandler_, Jun 26 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 23 03:02 EDT 2021. Contains 345395 sequences. (Running on oeis4.)