|
Search: id:A131798
|
|
|
| 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
1
|
|
| 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; listen)
|
|
|
OFFSET
|
1,1
|
|
|
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 (stefan.steinerberger(AT)gmail.com), Oct 30 2007
|
|
CROSSREFS
|
Sequence in context: A029085 A087875 A099777 this_sequence A114212 A108355 A057951
Adjacent sequences: A131795 A131796 A131797 this_sequence A131799 A131800 A131801
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Oct 23 2007
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Oct 30 2007
|
|
|
Search completed in 0.002 seconds
|
