login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131798 a(n) = the maximum value from among (d(n+1),d(n+2),d(n+3),...,d(2n)), where d(m) is the number of positive divisors of m. 0
2, 3, 4, 4, 4, 6, 6, 6, 6, 6, 6, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..77.

EXAMPLE

For n = 10, we consider the values of (d(11),d(12),d(13),d(14),d(15),d(16),d(17),d(18),d(19),d(20)), which are (2,6,2,4,4,5,2,6,2,6). The greatest of these values is 6, so a(10) = 6.

MATHEMATICA

Table[Max[Table[Length[Divisors[i]], {i, n + 1, 2*n}]], {n, 1, 80}] (* Stefan Steinerberger, Oct 30 2007 *)

CROSSREFS

Sequence in context: A195848 A099777 A221917 * A206925 A114212 A108355

Adjacent sequences:  A131795 A131796 A131797 * A131799 A131800 A131801

KEYWORD

nonn

AUTHOR

Leroy Quet, Oct 23 2007

EXTENSIONS

More terms from Stefan Steinerberger, Oct 30 2007

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 26 10:18 EDT 2019. Contains 321491 sequences. (Running on oeis4.)