login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A135060 a(n) is the smallest number m for which none of the first n multiples of m has twice as many divisors as m. 5
1, 2, 6, 12, 60, 120, 840, 840, 2520, 2520, 27720, 55440, 720720, 720720, 1081080, 2162160, 36756720, 36756720, 698377680, 698377680, 698377680, 698377680, 16062686640, 48188059920, 160626866400, 160626866400, 160626866400 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n) is smallest integer m such that A129902(m)/m > n.
Conjecture: every number in this sequence is also in A002182. [J. Lowell disproved this conjecture at a(24) = 48188059920. - Ray Chandler]
The conjecture that every term is a multiple of the preceding term is disproved at n = 15; a(15) = 1081080, which is not a multiple of a(14) = 720720. - J. Lowell, Jun 06 2008
LINKS
EXAMPLE
60 is not a(6) because 60 has 12 divisors and 60*6=360 has 12*2=24 divisors.
CROSSREFS
Sequence in context: A224078 A309811 A309233 * A185021 A191836 A072486
KEYWORD
nonn
AUTHOR
J. Lowell, Feb 11 2008, Jul 08 2008, Jul 14 2008
EXTENSIONS
More terms from J. Lowell, May 13 2009
Inequality in the comment corrected and a(16) added by R. J. Mathar, Nov 04 2009
Extended by Ray Chandler, Nov 10 2009
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 14:32 EDT 2024. Contains 371914 sequences. (Running on oeis4.)