Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135060
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135060 a(n) = smallest number m for which none of the first n multiples of m has twice as many divisors as m. +0
5
1, 2, 6, 12, 60, 120, 840, 840, 2520, 2520, 27720, 55440, 720720, 720720, 1081080, 2162160 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) is smallest value m where A129902(m)/m > n.

Conjecture: every number in this sequence is also in A002182. Comment from J. Lowell (jhbubby(AT)mindspring.com), Jun 06 2008: 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 720720.

EXAMPLE

60 does not qualify for a(6) because 60 has 12 divisors and 60*6=360 has 12*2=24 divisors

KEYWORD

more,nonn,new

AUTHOR

J. Lowell (jhbubby(AT)mindspring.com), Feb 11 2008, Jul 08 2008, Jul 14 2008

EXTENSIONS

More terms from J. Lowell (jhbubby(AT)mindspring.com), May 13 2009

Corrected inequality in the comment and added a(16) - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 04 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 9 12:23 EST 2009. Contains 166233 sequences.


AT&T Labs Research